Makespan minimization in a no-wait flow shop problem with two batching machines

DOI10.1016/j.cor.2005.05.028zbMath1102.90051OpenAlexW2010391827MaRDI QIDQ856680

Ammar Oulamara

Publication date: 7 December 2006

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.05.028

zbMATH Keywords

complexitybatch processing machinesno-wait flowshop problem

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (9)

Performance evaluation of due-date based dispatching rules in dynamic scheduling of diffusion furnace ⋮ Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling ⋮ A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness ⋮ Minimizing makespan for multi-spindle head machines with a mobile table ⋮ A survey of scheduling problems with no-wait in process ⋮ Integrated problem of soaking pit heating and hot rolling scheduling in steel plants ⋮ Two-stage hybrid flow shop scheduling with dynamic job arrivals ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling a batching machine
• Scheduling and lot streaming in flowshops with no-wait in process
• Scheduling with batching: A review
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling Groups of Jobs on a Single Machine
• Maximum matching and a polyhedron with 0,1-vertices
• Scheduling batches with simultaneous job processing for two-machine shop problems
• Batch scheduling in the no-wait two-machine flowshop to minimize the makespan

This page was built for publication: Makespan minimization in a no-wait flow shop problem with two batching machines