Solving the Batch Scheduling Problem with Family Setup Times

Udo Buscher () and Liji Shen ()
Additional contact information
Udo Buscher: Industrial Management, Dresden University of Technology
Liji Shen: Industrial Management, Dresden University of Technology

Chapter 19 in Operations Research Proceedings 2008, 2009, pp 117-122 from Springer

Abstract: Summary In this paper we address the machine scheduling problem involving family setup times and batching decisions. The m-machine ow shop system is considered with the objective of minimizing the makespan. We first present a mathematical formulation which is able to solve small instances. Subsequently, a tabu search algorithm is proposed with diverse neighbourhoods.

Date: 2009
References: Add references at CitEc
Citations:

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:sprchp:978-3-642-00142-0_19

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

DOI: 10.1007/978-3-642-00142-0_19

Access Statistics for this chapter

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