Artikel
Efficient mixed integer programming models for family scheduling problems
This paper proposes several mixed integer programming models which incorporate optimal sequence properties into the models, to solve single machine family scheduling problems. The objectives are total weighted completion time and maximum lateness, respectively. Experiment results indicate that there are remarkable improvements in computational efficiency when optimal sequence properties are included in the models. For the total weighted completion time problems, the best model solves all of the problems up to 30-jobs within 5 s, all 50-job problems within 4 min and about 1/3 of the 75-job to 100-job problems within 1 h. For maximum lateness problems, the best model solves almost all the problems up to 30-jobs within 11 min and around half of the 50-job to 100-job problems within 1 h.
- Sprache
-
Englisch
- Erschienen in
-
Journal: Operations Research Perspectives ; ISSN: 2214-7160 ; Volume: 4 ; Year: 2017 ; Pages: 49-55 ; Amsterdam: Elsevier
- Klassifikation
-
Wirtschaft
- Thema
-
Family scheduling
Sequence independent setup
Total weighted completion time
Maximum lateness
- Ereignis
-
Geistige Schöpfung
- (wer)
-
Lin, Meng-Ye
Kuo, Yarlin
- Ereignis
-
Veröffentlichung
- (wer)
-
Elsevier
- (wo)
-
Amsterdam
- (wann)
-
2017
- DOI
-
doi:10.1016/j.orp.2017.03.001
- Handle
- Letzte Aktualisierung
-
10.03.2025, 11:44 MEZ
Datenpartner
ZBW - Deutsche Zentralbibliothek für Wirtschaftswissenschaften - Leibniz-Informationszentrum Wirtschaft. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- Artikel
Beteiligte
- Lin, Meng-Ye
- Kuo, Yarlin
- Elsevier
Entstanden
- 2017
Ähnliche Objekte (12)
Exact mixed-integer programming
Computational mixed-integer semidefinite programming
Mixed integer bilevel programming problems
Algorithms for Scheduling Problems and Integer Programming
Production Planning by Mixed Integer Programming
Mixed-integer programming for additive manufacturing
Mixed integer observation models, GPS decorrelation and integer programming
SILP : scheduling and allocating with integer linear programming
Mixed-integer programming subject to uncertain data
Fenchel Decomposition for Stochastic Mixed-IntegerProgramming
Tighter relaxations in mixed-integer nonlinear programming
Adaptive solver behavior in mixed-integer programming
Exact mixed-integer programming
Computational mixed-integer semidefinite programming
Mixed integer bilevel programming problems
Algorithms for Scheduling Problems and Integer Programming
Production Planning by Mixed Integer Programming
Mixed-integer programming for additive manufacturing
Mixed integer observation models, GPS decorrelation and integer programming
SILP : scheduling and allocating with integer linear programming
Mixed-integer programming subject to uncertain data
Fenchel Decomposition for Stochastic Mixed-IntegerProgramming
Tighter relaxations in mixed-integer nonlinear programming
Adaptive solver behavior in mixed-integer programming
Exact mixed-integer programming
Computational mixed-integer semidefinite programming
Mixed integer bilevel programming problems
Algorithms for Scheduling Problems and Integer Programming
Production Planning by Mixed Integer Programming
Mixed-integer programming for additive manufacturing
Mixed integer observation models, GPS decorrelation and integer programming
SILP : scheduling and allocating with integer linear programming
Mixed-integer programming subject to uncertain data
Fenchel Decomposition for Stochastic Mixed-IntegerProgramming
Tighter relaxations in mixed-integer nonlinear programming