The complexity of a cyclic scheduling problem with identical machines and precedence constraints

Author： Munier A.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.91, Iss.3, 1996-06, pp. : 471-480

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

Scheduling preemptive jobs with precedence constraints on parallel machines

By Djellab K.  

European Journal of Operational Research, Vol. 117, Iss. 2, 1999-09 ,pp. : 355-367

Elsevier

Access to resources Recommend Favorite

Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity

By Timkovsky V.G.  

European Journal of Operational Research, Vol. 149, Iss. 2, 2003-09 ,pp. : 355-376

Elsevier

Access to resources Recommend Favorite

Heuristics for unrelated machine scheduling with precedence constraints

By Herrmann J.   Proth J.-M.   Sauer N.  

European Journal of Operational Research, Vol. 102, Iss. 3, 1997-11 ,pp. : 528-537

Elsevier

Access to resources Recommend Favorite

Preemptive scheduling on identical parallel machines subject to deadlines

By Azizoglu M.  

European Journal of Operational Research, Vol. 148, Iss. 1, 2003-07 ,pp. : 205-210

Elsevier

Access to resources Recommend Favorite

Flowshop scheduling with identical jobs and uniform parallel machines

By Dessouky M.M.   Dessouky M.I.   Verma S.K.  

European Journal of Operational Research, Vol. 109, Iss. 3, 1998-09 ,pp. : 620-631

Elsevier

Access to resources Recommend Favorite