No-wait scheduling problems with batching machines

DOI10.1007/978-1-4614-1123-9_7MaRDI QIDQ2958672zbMATH OpenOpenAlexFDO

Authors A. Oulamara

Publication date 3 February 2017

Published in Just-in-Time Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4614-1123-9_7

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A survey of scheduling with parallel batch (p-batch) processing
• Makespan minimization in a no-wait flow shop problem with two batching machines
• Batching identical jobs
• scientific article; zbMATH DE number 5671136
• Batch scheduling in the no-wait two-machine flowshop to minimize the makespan

Cites work

• Batch sizing and job sequencing on a single machine
• Dynamic scheduling on a single batch processing machine with split compatibility graphs
• Flowshop scheduling problem with a batching machine and task compatibilities
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 866105 (Why is no real title available?)
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Minimizing mean completion time in a batch processing system
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Paths, Trees, and Flowers
• Scheduling a batching machine
• Scheduling batches with sequential job processing for two-machine flow and open shops
• Scheduling batches with simultaneous job processing for two-machine shop problems
• Scheduling Groups of Jobs on a Single Machine
• Scheduling hybrid flowshop with parallel batching machines and compatibilities
• Scheduling on a batch machine with job compatibilities
• Scheduling with batching: A review
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• The complexity of one-machine batching problems
• Weighted coloring on planar, bipartite and split graphs: Complexity and approximation

Cited in

(3)

• Batching and scheduling. Models and methods for several problem classes
• A survey of scheduling problems with no-wait in process
• A survey of scheduling with parallel batch (p-batch) processing

This page was built for publication: No-wait scheduling problems with batching machines

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