A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
From MaRDI portal
Publication:878578
DOI10.1016/j.cor.2005.11.011zbMath1185.90086OpenAlexW2087973581MaRDI QIDQ878578
Publication date: 26 April 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.11.011
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints, Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times, A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks, Integrated production and delivery on parallel batching machines, Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times, Scheduling parallel-machine batch operations to maximize on-time delivery performance, 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, Single batch machine scheduling with dual setup times for autoclave molding manufacturing, A constraint programming approach for a batch processing problem with non-identical job sizes, Exact methods for the oven scheduling problem, Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems, Learning-augmented heuristics for scheduling parallel serial-batch processing machines, Batch machine production with perishability time windows and limited batch size, Heuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job families, A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes, Minimizing makespan for multi-spindle head machines with a mobile table, Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes, Makespan minimization on single batch-processing machine via ant colony optimization, A memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrival, Order acceptance using genetic algorithms, Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness, Revisit of the scheduling problems with integrated production and delivery on parallel batching machines, A survey of scheduling with parallel batch (p-batch) processing, Single-machine batch scheduling with job processing time compatibility
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient scheduling algorithms for a single batch processing machine
- A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops
- Minimizing due date related performance measures on two batch processing machines
- Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- A genetic algorithm methodology for complex scheduling problems
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times
- Scheduling batch processing machines with incompatible job families
- Scheduling Groups of Jobs on a Single Machine
- Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm
