Flowshop scheduling problem with a batching machine and task compatibilities

DOI10.1016/J.COR.2007.10.006MaRDI QIDQ954038zbMATH OpenOpenAlexFDO

Authors Gerd Finke, A. Oulamara, Aimé Kamgaing Kuiteing

Publication date 7 November 2008

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

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

zbMATH Keywords

batch processing machinesflowshop problemtask compatibilities

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Scheduling hybrid flowshop with parallel batching machines and compatibilities
• Makespan minimization in a no-wait flow shop problem with two batching machines
• Batch processing with interval graph compatibilities between tasks
• scientific article; zbMATH DE number 1731176
• Scheduling a batch processing machine with bipartite compatibility graphs

Cites work

• scientific article; zbMATH DE number 1731176 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Batch processing with interval graph compatibilities between tasks
• Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Optimal two- and three-stage production schedules with set-up time included
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Scheduling Groups of Jobs on a Single Machine
• Scheduling a batching machine
• Scheduling batches with simultaneous job processing for two-machine shop problems
• Scheduling on a batch machine with job compatibilities
• Scheduling with batching: A review

Cited in

(14)

• Arc-flow approach for single batch-processing machine scheduling
• Minimizing total completion time on a batching machine with job processing time compatibilities
• Scheduling an unbounded batching machine with job processing time compatibilities
• 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
• Scheduling a proportionate flow shop of batching machines
• Single-machine batch scheduling with job processing time compatibility
• A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost
• A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
• Makespan minimization in a no-wait flow shop problem with two batching machines
• No-wait scheduling problems with batching machines
• Scheduling hybrid flowshop with parallel batching machines and compatibilities
• Two-agent scheduling with agent specific batches on an unbounded serial batching machine
• scientific article; zbMATH DE number 6263663 (Why is no real title available?)
• Sequencing and scheduling in flowshops with task redistribution

This page was built for publication: Flowshop scheduling problem with a batching machine and task compatibilities

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