Pareto and scalar bicriterion optimization in scheduling deteriorating jobs

Computers and Operations Research

Volumn 33, Issue 3, 2006, Pages 746-767

  Gawiejnowicz, S ^a   Kurc, W ^a   Pankowska, L ^a  

^a ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

Bicriterion scheduling; Deteriorating jobs; Maximum completion time; Pareto optimality; Single machine; Total completion time

Indexed keywords

FUNCTIONS; JOB ANALYSIS; OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

JOB SCHEDULING; LINEAR FUNCTIONS; PARETO OPTIMAL SCHEDULE; PROCESSING JOBS;

SCHEDULING;

EID: 23344439483     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2004.07.016     Document Type: Article

References (32)

1. B. Alidaee, and N.K. Womer Scheduling with time dependent processing times review and extensions Journal of the Operational Research Society 50 1999 711 720
2. T.C.E. Cheng, Q. Ding, and B.M.T. Lin A concise survey of scheduling with time-dependent processing times European Journal of the Operational Research 152 2004 1 13
3. J.A. Hoogeveen Single machine bicriteria scheduling 1992 CWI Amsterdam
4. J-C. Billaut, and V. T'Kindt Multicriteria scheduling theory, models and algorithms 2002 Springer Berlin, Heidelberg
5. A. Nagar, J. Haddock, and S. Heragu Multiple and bicriteria scheduling a literature survey European Journal of the Operational Research 81 1995 88 104
6. M. Ehrgott Multicriteria optimization. Lecture Notes in Economics and Mathematical Systems, 491 2000 Springer Berlin, Heidelberg
7. O.I. Melnikov, and Y.M. Shafransky Parametric problem of scheduling theory Kibernetika 6 1979 53 57 (in Russian). Cybernetics 1980;15:352-7 (English translation)
8. S.K. Gupta, A.S. Kunnathur, and K. Dandapani Optimal repayment policies for multiple loans Omega 15 1987 323 330
9. G. Mosheiov V-shaped policies for scheduling deteriorating jobs Operations Research 39 1991 979 991
10. G. Mosheiov Scheduling jobs under simple linear deterioration Computers and Operations Research 21 1994 653 659
11. G. Finke, M.L. Espinouse, and H. Jiang General flowshop models job dependent capacities, job overlapping and deterioration International Transactions in Operational Research 9 2002 399 414
12. S. Gawiejnowicz A brief survey of continuous models of scheduling Foundations of Computing and Decision Sciences 21 1996 81 100
13. E. Wagneur, and C. Sriskandarajah The two-machine permutation flow shop with state-dependent processing times Naval Research Logistics 40 1993 697 717
14. Gawiejnowicz S, Kurc W, Pankowska L. Minimizing time-dependent total completion time on parallel identical machines. In: Wyrzykowski R, et al., editors. Parallel processing and applied mathematics, Lecture Notes in Computer Science 3019. Berlin, Heidelberg: Springer; 2004, p. 89-96.
15. S. Browne, and U. Yechiali Scheduling deteriorating jobs on a single processor Operations Research 38 1990 495 498
16. S. Gawiejnowicz, and L. Pankowska Scheduling jobs with varying processing times Information Processing Letters 54 1995 175 178
17. J.N.D. Gupta, and S.K. Gupta Single facility scheduling with nonlinear processing times Computers and Industrial Engineering 14 1988 387 393
18. V.S. Tanaev, V.S. Gordon, and Y.M. Shafransky Scheduling theory. Single-stage Systems 1994 Kluwer Dordrecht
19. Z-L. Chen Parallel machine scheduling with time dependent processing times Discrete Applied Mathematics 70 1996 81 93 (Erratum: Discrete Applied Mathematics 1996;75:103)
20. Kononov A. Scheduling problems with linear increasing processing times. In: Zimmermann U, et al., editors. Operations research 1996. Selected papers of the symposium on operations research. Berlin, Heidelberg: Springer; 1997, p. 208-12.
21. G. Mosheiov Multi-machine scheduling with linear deterioration Infor 36 1998 205 214
22. A. Kononov, and S. Gawiejnowicz NP-hard cases in scheduling deteriorating jobs on dedicated machines Journal of the Operational Research Society 52 2001 708 717
23. G. Mosheiov Complexity analysis of job-shop scheduling with deteriorating jobs Discrete Applied Mathematics 117 2002 195 209
24. W.E. Smith Various optimizers for single-stage production Naval Research Logistics Quarterly 3 1956 59 66
25. H. Ishii, M. Tada, and T. Nishida Bi-criteria scheduling problem on uniform processors Mathematica Japonica 35 1990 515 519
26. T. Masuda, and H. Ishii Two machine open shop scheduling problem with bi-criteria Discrete Applied Mathematics 52 1994 253 259
27. P. Dileepan, and T. Sen Bicriterion static scheduling research for a single machine Omega 16 1988 53 59
28. C-Y. Lee, and G. Vairaktarakis Complexity of single machine hierarchical scheduling a survey P.M Pardalos Complexity in numerical optimization 1993 World Scientific Singapore 269 298
29. F. Hirsch, and G. Lacombe Elements of functional analysis 1999 Springer Berlin, Heidelberg
30. Gawiejnowicz S, Kurc W, Pankowska L. A greedy approach for a time-dependent scheduling problem. In: Wyrzykowski R, et al., editors. Parallel processing and applied mathematics, Lecture Notes in Computer Science 2328. Berlin, Heidelberg: Springer; 2002, p. 79-86.
31. Gawiejnowicz S, Kurc W, Pankowska L. Polynomial-time solutions in a bicriterion time-dependent scheduling problem. Report 115/2002, Adam Mickiewicz University, Faculty of Mathematics and Computer Science, Poznań, Poland, October 2002.
32. G. Rau Minimizing a function of permutations of n integers. Operations Research 19 1971 237 240