Erratum: Corrigendum to “Scheduling jobs with values dependent on their completion times” (International Journal of Production Economics (2012) 135 (231–241) (S092552731100315X) (10.1016/j.ijpe.2011.07.014));Scheduling jobs with values dependent on their completion times

International Journal of Production Economics

Volumn 135, Issue 1, 2012, Pages 231-241

  Janiak, Adam ^a   Krysiak, Tomasz ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

Computational complexity; Heuristic; Job value; Scheduling

Indexed keywords

COMPUTATIONAL COMPLEXITY; HARDNESS; HEURISTIC ALGORITHMS; PARALLEL PROCESSING SYSTEMS; PIECEWISE LINEAR TECHNIQUES; POLYNOMIAL APPROXIMATION; SCHEDULING;

HEURISTIC; JOB VALUE; PARALLEL PROCESSOR; PIECEWISE LINEAR; PSEUDO-POLYNOMIAL TIME ALGORITHMS; SCHEDULING PROBLEM; SINGLE PROCESSORS; UNRELATED PARALLELS;

JOB SHOP SCHEDULING;

EID: 80055058969     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2016.05.025     Document Type: Erratum

References (36)

1. A. Bachman, and A. Janiak Minimizing maximum lateness under linear deterioration European Journal of Operational Research 126 2000 557 566
2. T.C.E. Cheng, and M.Y. Kovalyov Single machine batch scheduling with deadlines and resource dependent processing times Operations Research Letters 17 1995 243 249
3. P. Chrétienne, and F. Sourd PERT scheduling with convex cost functions Theoretical Computer Science 292 2003 145 164
4. Cisco Systems Inc., 2010. Quality of Service Networking. In: Internetworking Technology Handbook. 〈 www.cisco.com/en/US/docs/ internetworking/technology/handbook/QoS.pdf 〉.
5. R.L. Graham, E.L. Lawler, J.K. Lenstra, and A.H.G. Rinnooy Kan Optimization and approximation in deterministic sequencing and scheduling: a survey Annals of Discrete Mathematics 5 1979 287 326
6. K. Inderfurth, M.Y. Kovalyov, C.T. Ng, and F. Werner Cost minimizing scheduling of work and rework processes on a single facility under deterioration of reworkables International Journal of Production Economics 105 2 2007 345 356
7. K. Inderfurth, G. Lindner, and N.P. Rachaniotis Lot sizing in a production system with rework and product deterioration International Journal of Production Research 43 7 2005 1355 1374
8. Jackson, J.R., 1955. Scheduling a Production Line to Minimize Maximum Tardiness. Research Report 43, Management Science Research Project, University of California, USA.
9. A. Janiak, and T. Krysiak Single processor scheduling with job values dependent on their completion times Journal of Scheduling 10 2007 129 138
10. A. Janiak, T. Krysiak, C.P. Pappis, and T.G. Voutsinas A scheduling problem with job values given as a power function of their completion times European Journal of Operational Research 193 2009 836 848
11. A. Janiak, and C.-L. Li Scheduling to minimize the total weighted completion time with a constraint on the release time resource consumption Mathematical and Computer Modelling 20 1994 53 58
12. M.Y. Kovalyov, and W. Kubiak A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs Journal of Heuristics 3 1998 287 297
13. M.Y. Kovalyov, and Y.M. Shafransky Uniform machine scheduling of unit-time jobs subject to resource constraints Discrete Applied Mathematics 84 1998 253 257
14. M.Y. Kovalyov, and F. Werner Approximation schemes for scheduling jobs with common due date on parallel machines to minimize total tardiness Journal of Heuristics 8 2002 415 428
15. E.L. Lawler A 'pseudopolynomial' algorithm for sequencing jobs to minimize total tardiness Annals of Discrete Mathematics 1 1977 331 342
16. E.L. Lawler, J.K. Lenstra, A.H.G. Rinooy Kan, and D.B. Shmoys Sequencing and scheduling: algorithms and complexity S.C. Graves, A.H.G. Rinnooy Kan, P. Zipkin, Handbooks in Operations Research and Management Science 1993 North-Holland 445 522
17. J.K. Lenstra, A.H.G. Rinnooy Kan, and P. Brucker Complexity of machine scheduling problems Annals of Discrete Mathematics 1 1977 343 362
18. S. Li, C.T. Ng, and J. Yuan Scheduling deteriorating jobs with CON/SLK due date assignment on a single machine International Journal of Production Economics 131 2011 747 751
19. F. Mafakheri, M. Breton, and A. Ghoniem Supplier selection-order allocation: a two-stage multiple criteria dynamic programming approach International Journal of Production Economics 132 2011 52 57
20. J.M. Moore An n jobs, one machine sequencing algorithm for minimizing the number of late jobs Management Science 15 1968 102 109
21. G. Mosheiov Scheduling jobs under simple linear deterioration Computers and Operations Research 21 1994 653 659
22. G. Mosheiov Scheduling jobs with step-deterioration: minimizing makespan on a single and multi-machine Computers and Industrial Engineering 28 1995 869 879
23. G. Mosheiov Complexity analysis of job-shop scheduling with deteriorating jobs Discrete Applied Mathematics 117 2002 195 209
24. C.T.D. Ng, T.C.E. Cheng, M.Y. Kovalyov, and S.S. Lam Single machine scheduling with a variable common due date and resource-dependent processing times Computers and Operations Research 30 2003 1173 1185
25. C.P. Pappis, and N.P. Rachaniotis Scheduling a single fire fighting resource with deteriorating fire suppression times and set-up times Operational Research: An International Journal 10 2010 27 42
26. C.P. Pappis, and N.P. Rachaniotis Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires Journal of Heuristics 16 4 2010 617 632
27. N.P. Rachaniotis, and C.P. Pappis Scheduling fire-fighting tasks using the concept of deteriorating jobs Canadian Journal of Forest Research 36 2006 652 658
28. A.H.G. Rinnooy Kan, B.J. Lageweg, and J.K. Lenstra Minimizing total costs in one-machine scheduling Operations Research 23 1975 908 927
29. D. Shabtay Scheduling and due date assignment to minimize earliness, tardiness, holding, due date assignment and batch delivery costs International Journal of Production Economics 123 2010 235 242
30. K.S. Siyan, and T. Parker TCP/IP Unleashed 2002 Sams Publishing
31. F. Sourd Optimal timing of a sequence of tasks with general completion costs European Journal of Operational Research 165 2005 82 96
32. M.A. Sportack, and A. Northrup Networking Essentials Unleashed 1998 Sams Publishing
33. T.G. Voutsinas, and C.P. Pappis Scheduling jobs with values exponentially deteriorating over time International Journal of Production Economics 79 2002 163 169
34. X. Wang, and T.C.E. Cheng Logistics scheduling to minimize inventory and transport costs International Journal of Production Economics 121 2009 266 273
35. L. Wang, L.-Y. Sun, L.-H. Sun, and J.-B. Wang On three-machine flow shop scheduling with deteriorating jobs International Journal of Production Economics 125 2010 185 189
36. C.-L. Zhao, and H.-Y. Tang Scheduling deteriorating jobs under disruption International Journal of Production Economics 125 2010 294 299