Optimal scheduling of the -machine assembly-type flow shop
Previous Page 2
Displaying 21 – 32 of 32
Optimal scheduling of the 3-machine assembly-type flow shop
Mohamed Haouari, Thouraya Daouas (2010)
RAIRO - Operations Research
We address the 3-Machine Assembly-Type Flowshop Scheduling Problem (3MAF). This problem is known to be NP-complete in the strong sense. We propose an exact branch and bound method based on a recursive enumeration of potential inputs and outputs of the machines. Using this algorithm, several large size instances have been solved to optimality.
Optimal starting times for a class of single machine scheduling problems with earliness and tardiness penalties
Milan Vlach, Karel Zimmermann (1997)
Kybernetika
Optimization Algorithms for a Class of Single Machine Scheduling Problems Using Due Date determination Methods
N.I. Karacapilidis, C.P. Pappis (1995)
The Yugoslav Journal of Operations Research
Optimum ordering policies with lead time for an operating unit
T. Nakagawa, S. Osaki (1978)
RAIRO - Operations Research - Recherche Opérationnelle
Optimum workforce scheduling under the (14, 21) days-off timetable.
Alfares, Hesham K. (2002)
Journal of Applied Mathematics and Decision Sciences
Ordonnancement de tâches sur un système multiprocesseur - modèles déterministes et modèles stochastiques
S. Norre (1994)
RAIRO - Operations Research - Recherche Opérationnelle
Ordonnancements à contraintes disjonctives
Jacques Carlier (1978)
RAIRO - Operations Research - Recherche Opérationnelle
Ordonnancements. La notion de «parties obligatoires» et son application aux problèmes cumulatifs
Abdelkader Lahrichi (1982)
RAIRO - Operations Research - Recherche Opérationnelle
Original title unknown
Issledovanija po prikladnoj matematike
Original title unknown
Issledovanija po prikladnoj matematike
Original title unknown
Issledovanija po prikladnoj matematike
Currently displaying 21 – 32 of 32
Previous Page 2