A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence-dependent setup time

Computers and Operations Research

Volumn 31, Issue 10, 2004, Pages 1727-1751

  Rabadi, Ghaith ^a   Mollaghasemi, Mansooreh ^b   Anagnostopoulos, Georgios C ^c  

^a OLD DOMINION UNIVERSITY   (United States)

^b UNIVERSITY OF CENTRAL FLORIDA   (United States)

^c FLORIDA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Branch and bound; Common due date; Earliness tardiness; Early tardy; Sequence dependent setup times; Single machine scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; OPERATIONS RESEARCH; PROBLEM SOLVING;

BRANCH-AND-BOUND ALGORITHMS;

SCHEDULING;

ALGORITHM;

EID: 1842762099     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(03)00117-5     Document Type: Article

References (23)

1. Kanet J.J. Minimizing the average deviation of job completion times about a common due date Naval Research Logistics 28 1981 643-651
2. Baker K.R. Scudder G.D. Sequencing with earliness and tardiness penalties: a review Operations Research 38 1 1990 22-36
3. Hall N.G. Single- and multiple-processor models for minimizing completion time variance Naval Research Logistics Quarterly 33 1986 49-54
4. Hall N.G. Posner M.E. Earliness-tardiness scheduling problems, I: weighted deviation of completion times about a common due date Operations Research 39 5 1991 836-846
5. Azizoglu M. Webster S. Scheduling job families about an unrestricted common due date on a single machine International Journal of Production Research 35 5 1997 1321-1330
6. Bagchi U. Sullivan R. Chang Y.-.L. Minimizing mean absolute deviation of completion times about a common due date Naval Research Logistics Quarterly 33 1986 227-240
7. Szwarc W. Single machine scheduling to minimize absolute deviation of completion times from a common due date Naval Research Logistics 36 1989 663-673
8. Szwarc W. The weighted common due date single machine scheduling problem revisited Computers and Operations Research 23 3 1996 255-262
9. Hall N.G. Kubiak W. Sethi S.P. Earliness-tardiness scheduling problems, II: deviation of completion times about a restrictive common due date Operations Research 39 5 1991 847-856
10. Alidaee B. Dragan I. A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: a case of small common due date European Journal of Operational Research 96 1997 559-563
11. Mondal S.A. Sen A.K. Single machine weighted earliness-tardiness penalty problem with a common due date Computers and Operation Research 28 7 2001 649-669
12. French S. Sequencing and scheduling: an introduction to the mathematics of the job-shop 1982 Wiley New York
13. Coleman B.J. A simple model for optimizing the single machine early/tardy problem with sequence-dependent setups Production and Operation Management 1 1992 225-228
14. Chen Z.-.L. Scheduling with batch setup times and earliness-tardiness penalties European Journal of Operational Research 96 1997 518-537
15. Allahverdi A. Gupta J.N.D. Aldowaisan T. A review of scheduling research involving setup consideration OMEGA 27 2 1999 219-239
16. Gendreau M. Laporte L. Guimaraes E.M. A divide and merge heuristic for the multiprocessor scheduling problem with sequence dependent setup times European Journal of Operational Research 133 2001 183-189
17. Rabadi G. Minimizing the total earliness and tardiness for a single machine scheduling problem with a common due date and sequence dependent setup times. Dissertation, University of Central Florida, USA, 1999.
18. Baker K.R. Elements of sequencing and scheduling 1997 Baker Press Hanover
19. Fourer R. Gay D.M. Kernighan B.W. AMPL: a modeling language for mathematical programming 1993 Boyd - Fraser Danvers, MA
20. ILOG CPLEX, ILOG CPLEX 6.5 user's manual. France: ILOG, 1999.
21. Balakrishnan N. Kanet J.J. Sridharan S.V. Early/tardy scheduling with sequence dependent setup on uniform parallel machines Computers and Operations Research 26 2 1999 127-141
22. Papadimitriou C.H. Steiglitz K.S. Combinatorial optimization 1982 Prentice-Hall Englewood Cliffs, NJ
23. Liaw C.-.F. A branch-and-bound algorithm for the single-machine earliness and tardiness scheduling problem Computers and Operations Research 26 7 1999 679-693