Scheduling a batch processing machine with non-identical job sizes
From MaRDI portal
Publication:4510514
DOI10.1080/00207540050028034zbMath0973.90511OpenAlexW2129359183MaRDI QIDQ4510514
Webster, Scott, Azizoglu, Meral
Publication date: 5 December 2001
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540050028034
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (19)
An effective formulation for optimal scheduling of multistage multi-product batch plant based on due dates ⋮ An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes ⋮ Formulating and solving a multi-mode resource-collaboration and constrained scheduling problem (MRCCSP) ⋮ Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling ⋮ Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine ⋮ A constraint programming approach for a batch processing problem with non-identical job sizes ⋮ A hybrid neural network approach to minimize total completion time on a single batch processing machine ⋮ Minimizing total completion time on non-identical parallel batch machines with arbitrary release times using ant colony optimization ⋮ Parallel batching with multi-size jobs and incompatible job families ⋮ A single-machine, single-wafer-processing, multiple-lots-per-carrier scheduling problem to minimize the sum of lot completion times ⋮ Dynamic scheduling of batch servers with compatible product families ⋮ A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes ⋮ Dynamic scheduling of batch-processing machines with non-identical product sizes ⋮ Hybrid approach for a single-batch-processing machine scheduling problem with a just-in-time objective and consideration of non-identical due dates of jobs ⋮ Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines ⋮ An asymptotic PTAS for batch scheduling with nonidentical job sizes to minimize makespan ⋮ Column generation for minimizing total completion time in a parallel-batching environment ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ On-line problems of minimizing makespan on a single batch processing machine with nonidentical job sizes
This page was built for publication: Scheduling a batch processing machine with non-identical job sizes
