No-Wait Scheduling Problems with Batching Machines

A. Oulamara ()
Additional contact information
A. Oulamara: Nancy University, Ecole des Mines de Nancy

Chapter Chapter 7 in Just-in-Time Systems, 2012, pp 147-168 from Springer

Abstract: Abstract Scheduling problems with batching operation are largely considered in the literature of the last decade. Batching means that sets of jobs which are processed on the same machine are grouped together into batches. One distinguish in the literature of scheduling two types of batching, namely, parallel batching and serial batching. In parallel batching, jobs are processed simultaneously so that the processing time of batch is given by the largest processing times of jobs of this batch. In serial batching, jobs are processed sequentially so that the processing of batch is given by the total processing times of jobs of this batch. This chapter focuses on several problems of no-wait scheduling problem including batching machines. Theoretical and experimental results are presented and some future researches are discussed.

Keywords: Schedule Problem; Lagrangian Relaxation; Makespan Minimization; Flowshop Schedule Problem; Subgradient Algorithm (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations: View citations in EconPapers (3)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-1-4614-1123-9_7

Ordering information: This item can be ordered from
http://www.springer.com/9781461411239

DOI: 10.1007/978-1-4614-1123-9_7

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().