Complexity of parallel machine scheduling with processing-plus-wait due dates to minimize maximum absolute lateness

Author： Cheng T.C.E.   Kovalyov M.Y.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.114, Iss.2, 1999-04, pp. : 403-410

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 with agreeable release times and due dates on a batch processing machine

By Li C.-L.   Lee C.-Y.  

European Journal of Operational Research, Vol. 96, Iss. 3, 1997-02 ,pp. : 564-569

Elsevier

Access to resources Recommend Favorite

On two single machine scheduling problems with fuzzy processing times and fuzzy due dates

By Chanas S.   Kasperski A.  

European Journal of Operational Research, Vol. 147, Iss. 2, 2003-06 ,pp. : 281-296

Elsevier

Access to resources Recommend Favorite

Parallel machine scheduling with a common due window

By Chen Z.-L.   Lee C.-Y.  

European Journal of Operational Research, Vol. 136, Iss. 3, 2002-02 ,pp. : 512-527

Elsevier

Access to resources Recommend Favorite

Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan

By Lancia G.  

European Journal of Operational Research, Vol. 120, Iss. 2, 2000-01 ,pp. : 277-288

Elsevier

Access to resources Recommend Favorite

Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method

By Xiangtong Q.   Tu F.-S.  

European Journal of Operational Research, Vol. 105, Iss. 3, 1998-03 ,pp. : 502-508

Elsevier

Access to resources Recommend Favorite