A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival
From MaRDI portal
Publication:991390
DOI10.1016/j.cor.2010.03.017zbMath1231.90183OpenAlexW1990529873MaRDI QIDQ991390
Tsung-Che Chiang, Hsueh-Chien Cheng, Li-Chen Fu
Publication date: 7 September 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.03.017
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (10)
A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time ⋮ Modeling the dynamics of a multi-product manufacturing system: a real case application ⋮ 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 ⋮ Mathematical model and algorithm for the reefer mechanic scheduling problem at seaports ⋮ Performance evaluation of due-date based dispatching rules in dynamic scheduling of diffusion furnace ⋮ Single batch machine scheduling with dual setup times for autoclave molding manufacturing ⋮ A batch-oblivious approach for complex job-shop scheduling problems ⋮ A branch and bound algorithm for minimizing total completion time on a single batch machine with incompatible job families and dynamic arrivals ⋮ A survey of scheduling with parallel batch (p-batch) processing
Uses Software
Cites Work
- A multi-criteria approach for scheduling semiconductor wafer fabrication facilities
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
- Hybrid decomposition heuristics for solving large-scale scheduling problems in semiconductor wafer fabrication
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
- A hybrid genetic local search algorithm for the permutation flowshop scheduling problem
- Multiobjective scheduling of jobs with incompatible families on parallel batch machines
- Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
- Minimizing total weighted tardiness on a single batch process machine with incompatible job families
- Scheduling with batching: A review
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
- Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework
- Scheduling batch processing machines with incompatible job families
- Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness
- Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families
- Learning effective dispatching rules for batch processor scheduling
- Controlling delivery performance in semiconductor manufacturing using Look Ahead Batching
- Dynamic scheduling of batch-processing machines with non-identical product sizes
- Minimizing total weighted tardiness on a batch-processing machine with incompatible job families and job ready times
- Application of genetic algorithms in production and operations management: a review
- A memetic algorithm for the total tardiness single machine scheduling problem
This page was built for publication: A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival
