Job shop scheduling with group-dependent setups, finite buffers, and long time horizon

Author： Luh P.B.   Gou L.   Zhang Y.   Nagahora T.   Tsuji M.   Yoneda K.   Hasegawa T.   Kyoya Y.   Kano T.  

Publisher： Springer Publishing Company

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.76, Iss.1, 1998-01, pp. : 233-259

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Job shop scheduling with separable sequence-dependent setups

By Choi I-C.   Korkmaz O.  

Annals of Operations Research, Vol. 70, Iss. 1, 1997-01 ,pp. : 155-170

Springer Publishing Company

Access to resources Recommend Favorite

Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups

By Araujo Silvio   Arenales Marcos   Clark Alistair  

Journal of Heuristics, Vol. 13, Iss. 4, 2007-08 ,pp. : 337-358

Springer Publishing Company

Access to resources Recommend Favorite

Practical job shop scheduling

By Schutten J.M.J.  

Annals of Operations Research, Vol. 83, Iss. 1, 1998-01 ,pp. : 161-178

Springer Publishing Company

Access to resources Recommend Favorite

Using Genetic Algorithms and Heuristics for Job Shop Scheduling with Sequence-Dependent Setup Times

By Cheung W.  

Annals of Operations Research, Vol. 107, Iss. 1-4, 2001-10 ,pp. : 65-81

Springer Publishing Company

Access to resources Recommend Favorite

Preemptive scheduling with finite capacity input buffers

By Hall N.G.   Posner M.E.   Potts C.N.  

Annals of Operations Research, Vol. 70, Iss. 1, 1997-01 ,pp. : 399-413

Springer Publishing Company

Access to resources Recommend Favorite