Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs

Author： Crauwels H.   Potts C.   Oudheusden D.   Van Wassenhove L.  

Publisher： Springer Publishing Company

ISSN： 1094-6136

Source： Journal of Scheduling, Vol.8, Iss.2, 2005-04, pp. : 161-177

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

An Exact Method to Minimize the Number of Tardy Jobs in Single Machine Scheduling

By Dauzère-Pérès Stéphane   Sevaux Marc  

Journal of Scheduling, Vol. 7, Iss. 6, 2004-11 ,pp. : 405-420

Springer Publishing Company

Access to resources Recommend Favorite

Single-machine scheduling to minimize maximumtardiness with minimum number of tardy jobs

By Gupta J.N.D.   Hariri A.M.A.   Potts C.N.  

Annals of Operations Research, Vol. 92, Iss. 1, 1999-01 ,pp. : 107-123

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

A Branch and Bound Algorithm to Minimize Total Weighted Tardiness on a Single Processor: Models and Algorithms for Planning and Scheduling Problems (Editors: Philippe Baptiste, Jacques Carlier, Alix Munier, Andreas S. Schulz)

By Babu Pascal  

Annals of Operations Research, Vol. 129, Iss. 1-4, 2004-07 ,pp. : 33-46

Springer Publishing Company

Access to resources Recommend Favorite

Minimizing the number of late jobs on a single machine under due date uncertainty

By Aissi Hassene  

Journal of Scheduling, Vol. 14, Iss. 4, 2011-08 ,pp. : 351-360

Springer Publishing Company

Access to resources Recommend Favorite