Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
From MaRDI portal
Publication:3055315
DOI10.1080/00207540802010807zbMath1198.90174OpenAlexW2047596610MaRDI QIDQ3055315
Yu Ting Tai, Shu-Hsing Chung, Wen Lea Pearn
Publication date: 7 November 2010
Published in: International Journal of Production Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207540802010807
Related Items
Integrated production and transportation on parallel batch machines to minimize total weighted delivery time ⋮ A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services ⋮ Solving a bi-objective unrelated parallel batch processing machines scheduling problem: a comparison study ⋮ Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times ⋮ A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost ⋮ Arc-flow approach for single batch-processing machine scheduling ⋮ Parallel batch processing machines scheduling in cloud manufacturing for minimizing total service completion time ⋮ Single machine parallel-batch scheduling under time-of-use electricity prices: new formulations and optimisation approaches ⋮ Scheduling jobs with sizes and delivery times on identical parallel batch machines ⋮ Scheduling of Jobs on Dissimilar Parallel Machine Using Computational Intelligence Algorithms ⋮ Solving single batch-processing machine problems using an iterated heuristic ⋮ Solving a supply chain scheduling problem with non-identical job sizes and release times by applying a novel effective heuristic algorithm ⋮ Ant colony optimization algorithm for total weighted completion time minimization on non-identical batch machines ⋮ 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
Cites Work
- Efficient scheduling algorithms for a single batch processing machine
- Minimizing makespan on a single burn-in oven in semiconductor manufacturing
- Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
- Efficient Algorithms for Scheduling Semiconductor Burn-In Operations
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Scheduling a single batch processing machine with non-identical job sizes
- Dynamic scheduling of batch servers with compatible product families
- Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes
This page was built for publication: Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes
