| People | Locations | Statistics |
|---|---|---|
| Mouftah, Hussein T. |
| |
| Dugay, Fabrice |
| |
| Rettenmeier, Max |
| |
| Tomasch, Ernst | Graz |
|
| Cornaggia, Greta |
| |
| Palacios-Navarro, Guillermo |
| |
| Uspenskyi, Borys V. |
| |
| Khan, Baseem |
| |
| Fediai, Natalia |
| |
| Derakhshan, Shadi |
| |
| Somers, Bart | Eindhoven |
|
| Anvari, B. |
| |
| Kraushaar, Sabine | Vienna |
|
| Kehlbacher, Ariane |
| |
| Das, Raj |
| |
| Werbińska-Wojciechowska, Sylwia |
| |
| Brillinger, Markus |
| |
| Eskandari, Aref |
| |
| Gulliver, J. |
| |
| Loft, Shayne |
| |
| Kud, Bartosz |
| |
| Matijošius, Jonas | Vilnius |
|
| Piontek, Dennis |
| |
| Kene, Raymond O. |
| |
| Barbosa, Juliana |
|
Strusevich, V. A.
in Cooperation with on an Cooperation-Score of 37%
Topics
Publications (4/4 displayed)
- 2012Vyacheslav Tanaev: contributions to scheduling and related areascitations
- 2009Fifty years of scheduling: a survey of milestonescitations
- 2008Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generationcitations
- 2002Three-machine shop scheduling with partially ordered processing routescitations
Places of action
| Organizations | Location | People |
|---|
document
Three-machine shop scheduling with partially ordered processing routes
Abstract
This paper considers the problem of sequencing n jobs in a three-machine shop with the objective of minimising the maximum completion time. The shop consists of three machines, M _1, M _2 and M_{3}. A job is first processed on M _1 and then is assigned either the route ( M _2,M_{3}) or the route (M_{3}, M _2). Thus, for our model the processing route is given by a partial order of machines, as opposed to the linear order of machines for a job shop, or to an arbitrary sequence of machines for an open shop. The main result is on O( n log n ) time heuristic, which generates a schedule with the makespan that is at most 5/3 times the optimum value.
Topics
Search in FID move catalog