Batching identical jobs

DOI10.1007/S001860000088zbMath1023.90020OpenAlexW2077214869MaRDI QIDQ1401637

Philippe Baptiste

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

zbMATH Keywords

complexityschedulingdynamic programming

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (29)

Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times ⋮ A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services ⋮ Optimally competitive list batching ⋮ The lockmaster's problem ⋮ Parallel batch scheduling of equal-length jobs with release and due dates ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ When serial batch scheduling involves parallel batching decisions: a branch and price scheme ⋮ Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine ⋮ A note on batch scheduling on a two-machine flowshop with machine-dependent processing times ⋮ Mixed batch scheduling on identical machines ⋮ Batch machine production with perishability time windows and limited batch size ⋮ Integrated batch sizing and scheduling on a single machine ⋮ Bounded parallel-batching scheduling with two competing agents ⋮ On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times. ⋮ A bi-criteria optimization model for medical device sterilization ⋮ A model for minimizing active processor time ⋮ A survey of scheduling problems with setup times or costs ⋮ Bicriterion scheduling with equal processing times on a batch processing machine ⋮ Using genetic algorithm for lot sizing and scheduling problem with arbitrary job volumes and distinct job due date considerations ⋮ On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan ⋮ 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 Minimizing Total Tardiness in a Serial Batching Problem ⋮ Scheduling a proportionate flow shop of batching machines ⋮ Cost-sharing games in real-time scheduling systems ⋮ Cost-sharing games in real-time scheduling systems ⋮ Multi-Objective Optimization and Multi-Attribute Decision Making for a Novel Batch Scheduling Problem Based on Mould Capabilities ⋮ On scheduling an unbounded batch machine

This page was built for publication: Batching identical jobs