Job-shop scheduling with processing alternatives

Author： Kis T.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.151, Iss.2, 2003-12, pp. : 307-332

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 blocking and no-wait constraints

By Mascis A.   Pacciarelli D.  

European Journal of Operational Research, Vol. 143, Iss. 3, 2002-12 ,pp. : 498-517

Elsevier

Access to resources Recommend Favorite

Deterministic job-shop scheduling: Past, present and future

By Jain A.S.   Meeran S.  

European Journal of Operational Research, Vol. 113, Iss. 2, 1999-03 ,pp. : 390-434

Elsevier

Access to resources Recommend Favorite

A polynomial algorithm for a two-machine no-wait job-shop scheduling problem

By Kravchenko S.A.  

European Journal of Operational Research, Vol. 106, Iss. 1, 1998-04 ,pp. : 101-107

Elsevier

Access to resources Recommend Favorite

An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling

By Zesheng H.   Taeyong Y.   Tiger A.  

European Journal of Operational Research, Vol. 91, Iss. 1, 1996-05 ,pp. : 99-117

Elsevier

Access to resources Recommend Favorite

Job shop scheduling with beam search

By Sabuncuoglu I.   Bayiz M.  

European Journal of Operational Research, Vol. 118, Iss. 2, 1999-10 ,pp. : 390-412

Elsevier

Access to resources Recommend Favorite