Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes
From MaRDI portal
Publication:693407
DOI10.1016/j.apm.2011.09.061zbMath1252.90022MaRDI QIDQ693407
Bo Chen, Ba-Yi Cheng, Xiao-xuan Hu, Shan-Lin Yang
Publication date: 7 December 2012
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2011.09.061
90B35: Deterministic scheduling theory in operations research
Related Items
Scheduling algorithm for flow shop with two batch-processing machines and arbitrary job sizes, A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines, A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services, Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times, Multi-parallel work centers scheduling optimization with shared or dedicated resources in low-volume low-variety production systems, Uniform parallel machine scheduling with resource consumption constraint, Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration, Batch scheduling of nonidentical job sizes with minsum criteria, Scheduling jobs with sizes and delivery times on identical parallel batch machines, Parallel machine scheduling with tool loading, Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines, Effective heuristics for makespan minimization in parallel batch machines with non-identical capacities and job release times, A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems, A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach
Cites Work
- Minimizing number of tardy jobs on a batch processing machine with incompatible job families
- Minimizing the sum of earliness/tardiness in identical parallel machines schedule with incompatible job families: An improved MIP approach
- A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
- A note on minimizing makespan on a single batch processing machine with nonidentical job sizes
- Genetic algorithms to minimize the weighted number of late jobs on a single machine.
- Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
- Minimizing makespan on a single batching machine with release times and non-identical job sizes
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling a single batch processing machine with non-identical job sizes
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
