A bicriteria scheduling with sequence-dependent setup times

Applied Mathematics and Computation

Volumn 179, Issue 1, 2006, Pages 378-385

  Eren, Tamer ^a   Güner, Ertan ^b  

^a KIRIKKALE UNIVERSITY   (Turkey)

^b GAZI UNIVERSITY   (Turkey)

Author keywords

0 1 integer programming; Bicriteria; Sequence dependent setup times; Single machine scheduling

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; FUNCTIONS; HEURISTIC METHODS; INTEGER PROGRAMMING; JOB ANALYSIS; PROBLEM SOLVING;

0-1 INTEGER PROGRAMMING; BICRITERIA; SEQUENCE DEPENDENT SETUP TIMES; SINGLE MACHINE SCHEDULING;

SCHEDULING;

EID: 33747373886     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2005.11.112     Document Type: Article

References (27)

1. Allahverdi A., Gupta J.N.D., and Aldowaisan T. A review of scheduling research involving setup consideration. Omega 27 (1999) 219-239
2. Yang W.-H., and Liao C.-J. Survey of scheduling research involving setup times. International Journal of Systems Science 30 2 (1999) 143-155
3. Panwalker S.S., and Iskander W. A survey of scheduling rule. Operations Research 25 (1977) 45-61
4. Bianco L., Mingozzi A., and Ricciardelli S. The travelling salesman problem with cumulative costs. Networks 23 (1993) 81-91
5. Fischetti M., Laporte G., and Martello S. The delivery man problem and cumulative matroids. Operations Research 41 (1993) 1055-1064
6. Arcelus F.J., and Chandra R. On n-1-F setup dependent problems. Engineering Optimization 7 (1983) 59-67
7. Miyazaki S., and Ohta H. Backward scheduling to minimize the actual mean flow time with dependent and independent setup times. Proc. IXth ICPR (1987) 2680-2686
8. G.L. Ragatz, A branch-and-bound method for minimum tardiness sequencing on a single processor with sequence dependent setup times. In: Proceedings Twenty-fourth Annual Meeting of The Decision Sciences Institute, 1993, pp. 1375-1377.
9. Raman N., Rachamadugu R.V., and Talbot F.B. Real time scheduling of an automated manufacturing center. European Journal of Operational Research 40 (1989) 222-242
10. Lee Y.H., Bhaskaran K., and Pinedo M. A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Transactions 29 (1997) 45-52
11. Rubin P.A., and Ragatz G.L. Scheduling in a sequence dependent setup environment with genetic search. Computers and Operations Research 22 1 (1995) 85-99
12. Tan K.C., and Narasimhan R. Minimizing tardiness on a single processor with sequence-dependent setup times: a simulated annealing approach. Omega 25 6 (1997) 619-634
13. França P.M., Mendes A., and Moscato P. A memetic algorithm for the total tardiness single machine scheduling problem. European Journal of Operational Research 132 1 (2001) 224-242
14. Tan K.-C., Narasimhan R., Rubin P.A., and Ragatz G.L. A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times. Omega 28 3 (2001) 313-326
15. Bianco L., Ricciardelli S., Rinaldi G., and Sassano A. Scheduling tasks with sequence-dependent processing times. Naval Research Logistics 35 (1988) 177-184
16. He W., and Kusiak A. Scheduling manufacturing systems. Computers and Industrial Engineering 20 (1992) 163-175
17. Asano M., and Ohta H. Single machine scheduling using dominance relation to minimize earliness subject to ready and due times. International Journal of Production Economics 44 (1996) 35-43
18. Uzsoy R., Martin-Vega L.A., Lee C.Y., and Leonard P.A. Production scheduling algorithms for a semiconductor test facility. IEEE Transactions on Semiconductor Manufacturing 4 (1991) 270-280
19. Ovacik I.M., and Uzsoy R. Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times. International Journal of Production Research 32 (1994) 1243-1263
20. Lin K.S. Hybrid algorithm for sequencing with bicriteria. Journal of Optimization Theory and Applications 39 1 (1983) 105-124
21. Lee S.M., and Asllani A.A. Job scheduling with dual criteria and sequence-dependent setups: mathematical versus genetic programming. Omega 32 2 (2004) 145-153
22. Kan Rinnooy A.H.G. Machine Scheduling Problems (1976), Martinus Nijhoff, The Hague
23. Du J., and Leung J.Y.T. Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research 15 (1990) 483-495
24. Nawaz M., Enscore E.E., and Ham I. A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11 (1983) 91-95
25. Glover F. Future paths for integer programming and links to artificial intelligence. Computers and Operations Research 5 (1986) 533-549
26. Lindo Systems, Inc, Hyper LINDO/PC Release 6.01, Chicago, USA, 1997.
27. Rajendran C., and Ziegler H. Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times. European Journal of Operational Research 149 3 (2003) 513-522