Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
From MaRDI portal
Publication:4670270
DOI10.1080/00207540310001636994zbMath1099.90537OpenAlexW1978931881MaRDI QIDQ4670270
John W. Fowler, Hari Balasubramanian, Lars Mönch, Michele E. Pfund
Publication date: 18 April 2005
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540310001636994
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (22)
Dynamic control of the batch processor in a serial-batch processor system with mean tardiness performance ⋮ Job scheduling of diffusion furnaces in semiconductor fabrication facilities ⋮ A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time ⋮ Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint ⋮ Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times ⋮ Controlling delivery and energy performance of parallel batch processors in dynamic mould manufacturing ⋮ Performance evaluation of due-date based dispatching rules in dynamic scheduling of diffusion furnace ⋮ Scheduling a hybrid flowshop with batch production at the last stage ⋮ Decomposition heuristics for minimizing earliness-tardiness on parallel burn-in ovens with a common due date ⋮ Extending capacity planning by positive lead times and optional overtime, earliness and tardiness for effective master production scheduling ⋮ Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems ⋮ Learning-augmented heuristics for scheduling parallel serial-batch processing machines ⋮ Learning effective dispatching rules for batch processor scheduling ⋮ A hybrid DBH-VNS for high-end equipment production scheduling with machine failures and preventive maintenance activities ⋮ A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes ⋮ Solving single batch-processing machine problems using an iterated heuristic ⋮ Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times ⋮ A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival ⋮ Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes ⋮ Minimizing total earliness and tardiness on re-entrant batch processing machine with time windows
Uses Software
Cites Work
This page was built for publication: Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
