Reducing efficiently the search tree for multiprocessor job-shop scheduling problems
Year of publication: |
2013
|
---|---|
Authors: | Carballo, Lester ; Vakhania, Nodari ; Werner, Frank |
Published in: |
International journal of production research. - London : Taylor & Francis, ISSN 0020-7543, ZDB-ID 160477-6. - Vol. 51.2013, 23/24 (1/15.12.), p. 7105-7119
|
Subject: | job shop scheduling | branch-and-bound algorithm | solution tree | dominance relations | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Algorithmus | Algorithm | Produktionssteuerung | Production control |
-
Single machine scheduling to maximize the number of on-time jobs with generalized due-dates
Gerstl, Enrique, (2020)
-
Scheduling algorithms to minimise to total family flow time for job shops with job families
Yu, Jae-min, (2011)
-
Azadeh, Mohammad Ali, (2012)
- More ...
-
Scheduling unrelated machines with two types of jobs
Vakhania, Nodari, (2014)
-
Preemptive scheduling of equal-length jobs to maximize weighted throughput
Baptiste, Philippe, (2004)
-
An optimal rounding gives a better approximation for scheduling unrelated machines
Shchepin, Evgeny V., (2005)
- More ...