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

DOI10.1016/J.COR.2005.05.028zbMATH Open1102.90051OpenAlexW2010391827MaRDI QIDQ856680FDOQ856680

Authors: A. 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

Recommendations

• Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
• scientific article; zbMATH DE number 1731176
• Flowshop scheduling problem with a batching machine and task compatibilities
• Minimizing makespan in a two-machine flowshop scheduling with batching and release time
• scientific article; zbMATH DE number 764416

zbMATH Keywords

complexitybatch processing machinesno-wait flowshop problem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• 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 a batching machine
• Maximum matching and a polyhedron with 0,1-vertices
• Scheduling Groups of Jobs on a Single Machine
• Scheduling batches with simultaneous job processing for two-machine shop problems
• Scheduling and lot streaming in flowshops with no-wait in process
• Title not available (Why is that?)
• Batch scheduling in the no-wait two-machine flowshop to minimize the makespan

Cited In (21)

• Integrated problem of soaking pit heating and hot rolling scheduling in steel plants
• A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness
• Title not available (Why is that?)
• Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
• Minimizing flowtime for paired tasks
• No-wait scheduling problems with batching machines
• Algorithms for minimizing the makespan in a two-machine cross-docking flow shop problem
• Exact approaches for single machine total weighted tardiness batch scheduling
• Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
• Two-stage hybrid flow shop scheduling with dynamic job arrivals
• Performance evaluation of due-date based dispatching rules in dynamic scheduling of diffusion furnace
• Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
• Minimizing makespan in a two-machine flowshop scheduling with batching and release time
• No-wait flowshop scheduling problem with two criteria; total tardiness and makespan
• Flowshop scheduling problem with a batching machine and task compatibilities
• Scheduling incompatible tasks on two machines
• A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times
• Minimum deviation algorithm for two-stage no-wait flowshops with parallel machines
• A survey of scheduling with parallel batch (p-batch) processing
• Minimizing makespan for multi-spindle head machines with a mobile table
• A survey of scheduling problems with no-wait in process

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856680)