Výsledky vyhledávání

A robust approach for the single machine scheduling problem

Autor: J. Erschler, H. Trung La, Cyril Briand

Publikováno v: Journal of Scheduling. 10:209-221

This paper describes a robust approach for the single machine scheduling problem 1|r i |L max?. The method is said to be robust since it characterizes a large set of optimal solutions allowing to switch from one solution to another, without any perfo

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::bd8a1a56ed9dfc37746be90e4c57c36f
https://doi.org/10.1007/s10951-007-0010-3

Zobrazit plný text záznamu

A new sufficient condition of optimality for the two-machine flowshop problem

Autor: Cyril Briand, J. Erschler, H. Trung La

Publikováno v: European Journal of Operational Research. 169:712-722

This paper focuses on the characterization of a subset of optimal sequences for the famous two-machine o wshop problem. Based on the relative order of the job processing times, two particular interval structures are dened so that each job is associat

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::c1192f861806c7cd1b1b41d4db34e0da
https://doi.org/10.1016/j.ejor.2004.10.027

Zobrazit plný text záznamu