Flowshop scheduling problem with a batching machine and task compatibilities
From MaRDI portal
Publication:954038
DOI10.1016/J.COR.2007.10.006zbMATH Open1179.90149OpenAlexW1990235445MaRDI QIDQ954038FDOQ954038
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
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
- 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
- Optimal two- and three-stage production schedules with set-up time included
- Scheduling Groups of Jobs on a Single Machine
- Batch processing with interval graph compatibilities between tasks
- Scheduling on a batch machine with job compatibilities
- Scheduling batches with simultaneous job processing for two-machine shop problems
- Title not available (Why is that?)
- Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
Cited In (14)
- Arc-flow approach for single batch-processing machine scheduling
- Title not available (Why is that?)
- Sequencing and scheduling in flowshops with task redistribution
- A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost
- Scheduling a proportionate flow shop of batching machines
- Makespan minimization in a no-wait flow shop problem with two batching machines
- No-wait scheduling problems with batching machines
- 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
- Minimizing total completion time on a batching machine with job processing time compatibilities
- Scheduling an unbounded batching machine with job processing time compatibilities
- Two-agent scheduling with agent specific batches on an unbounded serial batching machine
- A problem reduction and decomposition approach for scheduling for a flowshop of batch processing machines
- Scheduling hybrid flowshop with parallel batching machines and compatibilities
- Single-machine batch scheduling with job processing time compatibility
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)
