Determination of common due window location in a single machine scheduling problem

By Liman S.D.   Panwalkar S.S.   Thongmee S.  

European Journal of Operational Research, Vol. 93, Iss. 1, 1996-08 ,pp. : 68-74

Elsevier

Access to resources Recommend Favorite

Scheduling under a common due-date on parallel unrelated machines

By Adamopoulos G.I.   Pappis C.P.  

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

Elsevier

Access to resources Recommend Favorite

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

By Cheng T.C.E.   Kovalyov M.Y.  

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

Elsevier

Access to resources Recommend Favorite

A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs

By Jinjiang Y.  

European Journal of Operational Research, Vol. 94, Iss. 1, 1996-10 ,pp. : 203-205

Elsevier

Access to resources Recommend Favorite

Simulated annealing and metaheuristic for randomized priority search algorithms for the aerial refuelling parallel machine scheduling problem with due date-to-deadline windows and release times

By Kaplan Sezgin  

Engineering Optimization, Vol. 45, Iss. 1, 2013-01 ,pp. : 67-87

Taylor & Francis Ltd

Access to resources Recommend Favorite