A mixed integer programming approach for the single machine problem with unequal release dates

In this paper, we consider the problem of scheduling on a one-machine, a set of operations subject to unequal release dates with respect to the total completion time. This problem is known to be NP-hard in the strong sense. We propose an algorithm based on a Mixed Integer Linear Programming. This al...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Computers & operations research Ročník 51; s. 323 - 330
Hlavní autori: Kooli, Anis, Serairi, Mehdi
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Kidlington Elsevier Ltd 01.11.2014
Elsevier
Pergamon Press Inc
Predmet:
Algorithms
Applied sciences
Computer Science
Computer simulation
Exact sciences and technology
Integer programming
Inventory control, production control. Distribution
Linear programming
Mathematical problems
Mathematical programming
Mixed integer programming
Operational research and scientific management
Operational research. Management science
Operations Research
Preprocessing
Production scheduling
Release dates
Scheduling algorithms
Scheduling, sequencing
Studies
Valid inequalities
Mixed integer programming
Valid inequalities
Preprocessing
Release dates
Performance evaluation
Computer simulation
Branch and bound method
Scheduling
Makespan
Implicit enumeration method
NP hard problem
Single machine
Inequality
ISSN:0305-0548, 1873-765X, 0305-0548
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In this paper, we consider the problem of scheduling on a one-machine, a set of operations subject to unequal release dates with respect to the total completion time. This problem is known to be NP-hard in the strong sense. We propose an algorithm based on a Mixed Integer Linear Programming. This algorithm includes the implementation of a preprocessing procedure together with the consideration of valid inequalities. A computer simulation to measure the performance of the algorithm shows that our proposed method outperforms state-of-the-art branch-and-bound algorithms.
Bibliografia:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2014.06.013