Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine

Naval Research Logistics

Volumn 50, Issue 3, 2003, Pages 273-288

  Dauzère Pérès, Stéphane ^a,c   Sevaux, Marc ^b  

^a ECOLE DES MINES DE NANTES   (France)

^b UNIVERSITÉ DE VALENCIENNES   (France)

^c NORWEGIAN SCHOOL OF ECONOMICS   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; LINEAR PROGRAMMING; SCHEDULING;

SINGLE MACHINE SCHEDULING PROBLEM;

PROBLEM SOLVING;

EID: 0037383293     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/nav.10056     Document Type: Article

References (12)

1. P. Baptiste, C. Le Pape, and L. Péridy, Global constraints for partial CSPs: A case study of resource and due-date constraints, 4th Int Conf Principles Practice Constraint Program, Pisa, Italy, 1998 [Lecture Notes in Computer Science, Springer-Verlag, New York, to appear].
2. H.A.J. Crauwels, C.N. Potts, and L.N. Van Wassenhove, Local search heuristics for single machine scheduling with batching to minimize the number of late jobs, Eur J Oper Res 90 (1996), 200-213.
3. S. Dauzère-Pérès, Minimizing late jobs in the general one machine scheduling problem, Eur J Oper Res 81 (1995), 134-142.
4. S. Dauzère-Pérès and M. Sevaux, Various mathematical programming formulations for a general one machine sequencing problem, Research Report 98/3/AUTO, École des Mines de Nantes, Nantes, France, 1998.
5. S. Dauzère-Pérès and M. Sevaux, An exact method to minimize the number of tardy jobs in single machine scheduling, Research Report 99/6/AUTO, École des Mines de Nantes, Nantes, France, 1999.
6. H. Rise, T. Ibaraki, and H. Mine, A solvable case of the one-machine scheduling problem with ready and due times, Oper Res 26(1) (1978), 121-126.
7. E.L. Lawler, Knapsack-like scheduling problems, the Moore-Hodgson Algorithm and the "Tower of Sets" property, Math Comput Model 20(2) (1994), 91-106.
8. J.K. Lenstra, A.H.G. Rinnooy Kan, and P. Brucker, Complexity of machine scheduling problems, Ann Discrete Math 1 (1977), 343-362.
9. J.M. Moore, A n job, one machine sequencing algorithm for minimizing the number of late jobs, Manage Sci 15(1) (1968), 102-109.
10. R.G. Parker and R.L. Rardin, Discrete optimization, Academic Press, New York, 1988.
11. C.N. Potts and L.N. Van Wassenhove, Algorithms for scheduling a single machine to minimize the weighted number of late jobs, Manage Sci 34(7) (1988), 834-858.
12. F.J. Villarreal and R.L. Bulfin, Scheduling a single machine to minimize the weighted number of tardy jobs, IIE Trans 15 (1983), 337-343.