Batching identical jobs
From MaRDI portal
Publication:1401637
DOI10.1007/s001860000088zbMath1023.90020MaRDI QIDQ1401637
Publication date: 18 August 2003
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001860000088
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research
90C39: Dynamic programming
Related Items
Using genetic algorithm for lot sizing and scheduling problem with arbitrary job volumes and distinct job due date considerations, A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services, A survey of single machine scheduling to minimize weighted number of tardy jobs, A model for minimizing active processor time, Parallel batch scheduling of equal-length jobs with release and due dates, Batch machine production with perishability time windows and limited batch size, Optimally competitive list batching, Bicriterion scheduling with equal processing times on a batch processing machine, On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times., Makespan minimization on single batch-processing machine via ant colony optimization, A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals, On scheduling an unbounded batch machine, A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times, Integrated batch sizing and scheduling on a single machine, Bounded parallel-batching scheduling with two competing agents, A survey of scheduling problems with setup times or costs, On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan, On Minimizing Total Tardiness in a Serial Batching Problem
