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...

Full description

Saved in:
Bibliographic Details
Published in:Computers & operations research 2014-11, Vol.51, p.323-330
Main Authors: Kooli, Anis, Serairi, Mehdi
Format: Article
Language:English
Subjects:
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
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/j.cor.2014.06.013