On the convexity of games corresponding to sequencing situations with due dates

Author： Borm P.   Fiestras-Janeiro G.   Hamers H.   Sanchez E.   Voorneveld M.  

Publisher： Elsevier

ISSN： 0377-2217

Source： European Journal of Operational Research, Vol.136, Iss.3, 2002-02, pp. : 616-634

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

On the balancedness of multiple machine sequencing games

By Hamers H.   Klijn F.   Suijs J.  

European Journal of Operational Research, Vol. 119, Iss. 3, 1999-12 ,pp. : 678-691

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

An iterative algorithm for scheduling UET tasks with due dates and release times

By Zinder Y.  

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

Elsevier

Access to resources Recommend Favorite

Analysis of the temporal decomposition procedure for scheduling with release and due dates

By Rabenasolo B.   Xianyi Z.   Happiette M.  

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

Elsevier

Access to resources Recommend Favorite

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