𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion

✍ Scribed by Adam Kasperski

Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
170 KB
Volume
33
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, the single machine sequencing problem with maximum lateness criterion is discussed. The parameters of the problem are imprecise and they are specified as intervals. The maximal regret criterion is applied to calculate the optimal sequence. A polynomial algorithm for the studied problem is constructed.

πŸ“œ SIMILAR VOLUMES

Fast algorithms to minimize the makespan
Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times
✍ Jinliang Cheng; George Steiner; Paul Stephenson πŸ“‚ Article πŸ“… 2002 πŸ› Springer US 🌐 English βš– 186 KB πŸ‘ 2 views

We consider the two-machine ow-shop problem with release times where the objective is to minimize either the makespan or the maximum lateness. We present a uniΓΏed treatment of various sequenceinterchange operators and derive powerful new dominance orders, which are incorporated into branchand-bound

Sequencing and due-date determination in
Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
✍ Soroush H.M. πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 215 KB

This paper studies the problem of simultaneous due-date determination and sequencing of a set of n jobs on a single machine where processing times are random variables and job earliness and tardiness costs are distinct. The objective is to determine the optimal sequence and the optimal due-dates whi