Erratum: Scheduling jobs on parallel machines to minimize a regular step total cost function (Journal of Scheduling DOI:10.1007/s10951-010-0203-z);Scheduling jobs on parallel machines to minimize a regular step total cost function

Journal of Scheduling

Volumn 14, Issue 6, 2011, Pages 523-538

  Detienne, Boris ^b   Dauzère Pérès, Stéphane ^a   Yugma, Claude ^a  

^a Center Microelectronics De Provence Georges Charpak   (France)

^b UNIVERSITY OF AVIGNON   (France)

Author keywords

Parallel machines; Scheduling; Step cost function; Total cost minimization

Indexed keywords

COSTS; INTEGER PROGRAMMING; SCHEDULING;

CONSTRAINT GENERATION; MIXED INTEGER LINEAR PROGRAMMING MODEL; PARALLEL MACHINE; PARALLEL MACHINE-SCHEDULING PROBLEMS; SCHEDULING JOBS; STEP COST FUNCTIONS; TOTAL COST FUNCTION; TOTAL COST MINIMIZATIONS;

COST FUNCTIONS;

EID: 84855912023     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-011-0250-0     Document Type: Erratum

References (24)

1. Baptiste, Ph., Le Pape, C., & Nuijten, W. (1999). Satisfiability tests and time-bound adjustments for cumulative scheduling problems. Annals of Operations Research, 92(0), 305-333.
2. Baptiste, P., Peridy, L., & Pinson, E. (2003). A branch and bound to minimize the number of late jobs on a single machine with release time constraints. European Journal of Operational Research, 144, 1-11.
3. Bornstein, C. T., Alcoforado, L. F., & Maculan, N. (2005). A graphoriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem. European Journal of Operational Research, 165, 649-656. (Pubitemid 40206347)
4. Bousetta, A., & Cross, A. (2005). Adaptative sampling methodology for in-line defect inspection. In IEEE/SEMI advanced manufacturing conference (pp. 25-31). (Pubitemid 41577652)
5. Brucker, P. (2007). Scheduling algorithms. Berlin: Springer.
6. Carlier, J. (1982). The one-machine sequencing problem. European Journal of Operational Research, 11, 42-47.
7. Chang, P. C., & Su, L. H. (2001). Scheduling n jobs on one machine to minimize the maximum lateness with a minimum number of tardy jobs. Computers and Industrial Engineering, 40, 349-360.
8. Chen, C.-L. (2008). An iterated local search for unrelated parallel machines problem with unequal ready times. In IEEE international conference on automation and logistics, Qingdao, China (pp. 2044-2047).
9. Dauzère-Pérès, S., & Sevaux, M. (2002). Using Lagrangean relaxation to minimize the weighted number of late jobs on a single machine. Naval Research Logistics, 50, 273-288.
10. Dauzère-Pérès, S., & Sevaux, M. (2004). An exact method to minimize the number of tardy jobs in single machine scheduling. Journal of Scheduling, 7, 405-420.
11. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP completeness. San Francisco: Freeman.
12. Good, R., & Purdy, M. (2007). An MILP approach to wafer sampling and selection. IEEE Transactions on Semiconductor Manufacturing, 20(4), 400-407.
13. Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 4, 287-326.
14. Jackson, J. R. (1955). Scheduling a production line to minimize maximum tardiness (Research Report 43). Management Science Research Project. University of California, Los Angeles.
15. Jouglet, A., Savourey D., Carlier, J., & Baptiste, P. (2008) Dominance-based heuristics for one-machine total cost scheduling problems. European Journal of Operational Research, 184, 879-899. (Pubitemid 47391163)
16. Lee, S. B., Lee, T.-Y., Liao, J., & Chang, Y.-C. (2003). A capacitydependence dynamic sampling strategy. In Proceedings of the international symposium on semiconductor manufacturing conference (pp. 312-314). Berlin: Springer.
17. Leung, J. Y.-T. (Ed.) (2004). Handbook of scheduling: algorithms, models, and performance analysis. London/Boca Raton: Chapman & Hall/CRC.
18. Lopez, P., Erschler, J., & Esquirol, P. (1992). Ordonnancement de tâches sous contraintes: une approche énergétique. Automatique, Productique, Informatique Industrielle, 26, 453-481.
19. Meral, A., & Omer, K. (1999). Scheduling jobs on unrelated parallel machines to minimize regular total cost functions. IIE Transactions, 31, 153-159.
20. M'Hallah, R., & Bulfin, R. L. (2005).Minimizing the weighted number of tardy jobs on parallel processors. European Journal of Operational Research, 160, 471-484.
21. Moore, J. M. (1968). An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15, 102-109.
22. Pinedo, M. L. (2005). Scheduling: theory, algorithms, and systems. Berlin: Springer.
23. Tanaka, S., & Fujikama, S. (2008). An efficient exact algorithm for general single-machine scheduling with machine idle time. In IEEE international conference on automation science and engineering (pp. 371-376).
24. Van den Akker, J. M., Hoogeveen, J. A., & Van de Velde, S. L. (1999). Parallel machine scheduling by column generation. Operations Research, 47, 862-872. (Pubitemid 30594275)