A single machine scheduling problem with common due window and controllable processing times

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

Annals of Operations Research, Vol. 70, Iss. 1, 1997-01 ,pp. : 145-154

Springer Publishing Company

Access to resources Recommend Favorite

Grasp with memory-based mechanisms for minimizing total tardiness in single machine scheduling with setup times

By Armentano Vinícius   Araujo Olinto  

Journal of Heuristics, Vol. 12, Iss. 6, 2006-12 ,pp. : 427-446

Springer Publishing Company

Access to resources Recommend Favorite

A branch and bound algorithm to minimise total weighted tardiness on a single batch processing machine with ready times and incompatible job families

By Tangudu S. K.   Kurz M. E.  

Production Planning and Control, Vol. 17, Iss. 7, 2006-10 ,pp. : 728-741

Taylor & Francis Ltd

Access to resources Recommend Favorite

Asymmetric Earliness and Tardiness Scheduling with Exponential Processing Times on an Unreliable Machine

By Cai X.  

Annals of Operations Research, Vol. 98, Iss. 1-4, 2000-12 ,pp. : 313-331

Springer Publishing Company

Access to resources Recommend Favorite

A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates

By Xu Kailiang  

Annals of Operations Research, Vol. 181, Iss. 1, 2010-12 ,pp. : 303-324

Springer Publishing Company

Access to resources Recommend Favorite