Robust Machine Scheduling Based on Group of Permutable Jobs

Christian Artigues (), Jean-Charles Billaut (), Azzedine Cheref (), Nasser Mebarki () and Zakaria Yahouni ()
Additional contact information
Christian Artigues: CNRS, LAAS
Jean-Charles Billaut: Laboratoire d’Informatique de l’Université de Tours
Azzedine Cheref: CNRS, LAAS
Nasser Mebarki: IRCCyN Institut de Recherche en Communication et Cybernétique de Nantes
Zakaria Yahouni: Tlemcen University

Chapter Chapter 9 in Robustness Analysis in Decision Aiding, Optimization, and Analytics, 2016, pp 191-220 from Springer

Abstract: Abstract This chapter presents the “group of permutable jobs” structure to represent set of solutions to disjunctive scheduling problems machine scheduling . Traditionally, solutions to disjunctive scheduling problems are represented by assigning sequence of jobs to each machine. The group of permutable jobs structure assigns an ordered partition of jobs to each machine, i.e. a group sequence. The permutation of jobs inside a group must be all feasible with respect to the problem constraints. Such a structure provides more flexibility to the end user and, in particular, allows a better reaction to unexpected events. The chapter considers the robust scheduling framework where uncertainty is modeled via a discrete set of scenarios, each scenario specifying the problem parameters values. The chapter reviews the models and algorithms that have been proposed in the literature for evaluating a group sequence with respect to scheduling objectives for a fixed scenario as well as the recoverable robust optimization methods that have been proposed for generating robust group sequence against scenario sets scenario set . The methods based on group sequences are compared with standard robust scheduling approaches based on job sequences. Finally, methods for exploiting group sequences in an industrial context are discussed and an experiment for human decision making in a real manufacturing system based on groups is reported.

Keywords: Schedule Problem; Completion Time; Tabu List; Tabu Search Algorithm; Group Sequence (search for similar items in EconPapers)
Date: 2016
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:isochp:978-3-319-33121-8_9

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

DOI: 10.1007/978-3-319-33121-8_9

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().