Makespan minimization in a no-wait flow shop problem with two batching machines
From MaRDI portal
(Redirected from Publication:856680)
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
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 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
- Maximum matching and a polyhedron with 0,1-vertices
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling Groups of Jobs on a Single Machine
- Scheduling a batching machine
- Scheduling and lot streaming in flowshops with no-wait in process
- Scheduling batches with simultaneous job processing for two-machine shop problems
- Scheduling with batching: A review
Cited in
(21)- Scheduling incompatible tasks on two machines
- A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness
- Algorithms for minimizing the makespan in a two-machine cross-docking flow shop problem
- Batch scheduling in the no-wait two-machine flowshop to minimize the makespan
- A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times
- Two-stage hybrid flow shop scheduling with dynamic job arrivals
- A survey of scheduling with parallel batch (p-batch) processing
- No-wait flowshop scheduling problem with two criteria; total tardiness and makespan
- Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard
- Integrated problem of soaking pit heating and hot rolling scheduling in steel plants
- Performance evaluation of due-date based dispatching rules in dynamic scheduling of diffusion furnace
- Flowshop scheduling problem with a batching machine and task compatibilities
- Minimizing makespan for multi-spindle head machines with a mobile table
- Exact approaches for single machine total weighted tardiness batch scheduling
- No-wait scheduling problems with batching machines
- Minimum deviation algorithm for two-stage no-wait flowshops with parallel machines
- scientific article; zbMATH DE number 1731176 (Why is no real title available?)
- A survey of scheduling problems with no-wait in process
- Minimizing makespan in a two-machine flowshop scheduling with batching and release time
- Minimizing flowtime for paired tasks
- Mixed integer formulation to minimize makespan in a flow shop with batch processing machines
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)
