A binary multiple knapsack model for single machine scheduling with machine unavailability
Year of publication: |
August 2016
|
---|---|
Authors: | Laalaoui, Y. ; M'Hallah, Rym |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 72.2016, p. 71-82
|
Subject: | Binary multiple knapsack | Single machine scheduling | Weighted number of tardy jobs | Variable neighborhood search | Machine maintenance | Machine availability | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Instandhaltung | Maintenance policy | Produktionssteuerung | Production control | Algorithmus | Algorithm | Durchlaufzeit | Lead time | Heuristik | Heuristics | Künstliche Intelligenz | Artificial intelligence |
-
Hadda, Hatem, (2015)
-
Two-machine flow shop and open shop scheduling problems with a single maintenance window
Mosheiov, Gur, (2018)
-
Scheduling jobs and maintenance activities subject to job-dependent machine deteriorations
Grigoriu, Liliana, (2017)
- More ...
-
Minimizing the weighted number of tardy jobs on parallel processors
M'Hallah, Rym, (2005)
-
Minimizing the weighted number of tardy jobs on a single machine
M'Hallah, Rym, (2003)
-
An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems
Hifi, Mhand, (2005)
- More ...