Single machine scheduling with controllable release and processing parameters

Discrete Applied Mathematics

Volumn 154, Issue 15, 2006, Pages 2178-2199

  Shakhlevich, Natalia V ^a   Strusevich, Vitaly A ^b  

^a UNIVERSITY OF LEEDS   (United Kingdom)

^b UNIVERSITY OF GREENWICH   (United Kingdom)

Author keywords

Controllable processing speeds; Controllable processing times; Controllable release dates; Controllable release speeds; Single machine scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA PROCESSING; POLYNOMIALS; SCHEDULING;

CONTROLLABLE PROCESSING SPEEDS; CONTROLLABLE PROCESSING TIMES; CONTROLLABLE RELEASE DATES; CONTROLLABLE RELEASE SPEEDS; SINGLE MACHINE SCHEDULING;

PROBLEM SOLVING;

EID: 33746868325     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2005.04.014     Document Type: Article

References (25)

1. A. Agnetis, N.G. Hall, D. Pacciarelli, Supply chain scheduling: sequence coordination, Discrete Appl. Math., this issue doi:10.1016/j.dam.2005.04.019.
2. Badics T., and Boros E. Minimization of half-products. Math. Oper. Res. 23 (1998) 649-660
3. Chen B., Potts C.N., and Woeginger G. A review of machine scheduling: complexity, algorithms and approximability. In: Du D.-Z., and Pardalos P.M. (Eds). Handbook of Combinatorial Optimization (1998), Kluwer, Dordrecht 21-169
4. Z.-L. Chen, N.G. Hall, Supply chain scheduling: assembly systems, Working Paper, Fisher College of Business, The Ohio State University, 2001.
5. T.C.E. Cheng, M.Y. Kovalyov, N.V. Shakhlevich, Scheduling with controllable release dates and processing times: Makespan minimization, European J. Oper. Res., to appear.
6. Du J., and Leung J.Y.-T. Minimizing total tardiness on one machine is NP-hard. Math. Oper. Res. 15 (1990) 483-495
7. Gordon V.S., Proth J.-M., and Chu C. A survey of the state-of-the-art of common due date assignment and scheduling research. European J. Oper. Res. 139 (2002) 1-25
8. Hall N.G. Supply chain scheduling. Book of Abstracts of the International Symposium on Combinatorial Optimization. Paris (2002) 10-11
9. Hall N.G., and Potts C.N. Supply chain scheduling: batching and delivery. Oper. Res. 51 (2003) 566-584
10. 〈http://staffweb.cms.gre.ac.uk/∼sv02/papers/animations1.html〉.
11. Ishii H., Masuda T., and Nishida T. Two machine mixed shop scheduling problem with controllable machine speeds. Discrete Appl. Math. 17 (1987) 29-38
12. Ishii H., and Nishida T. Two machine open shop scheduling problem with controllable machine speeds. J. Oper. Res. Soc. Japan 29 (1986) 123-131
13. Janiak A. Single machine scheduling problem with a common deadline and resource dependent release dates. European J. Oper. Res. 53 (1991) 317-325
14. Janiak A., Kovalyov M.Y., Kubiak W., and Werner F. Positive half-products and scheduling with controllable processing times. European J. Oper. Res. 165 (2005) 416-422
15. Lawler E.L. A 'pseudopolynomial' algorithm for sequencing jobs to minimize total tardiness. Ann. Discrete Math. 1 (1977) 331-342
16. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys, Sequencing and scheduling: algorithms and complexity, in: S.C. Graves, A.H.G. Rinnooy Kan, P.H. Zipkin (Eds.), Handbooks in Operations Research and Management Science, vol. 4, Logistics of Production and Inventory, North-Holland, Amsterdam, 1993, pp. 455-522.
17. Li C.L. Scheduling with resource dependent release dates-a comparison of two different resource consumption functions. Naval Res. Logist. 41 (1994) 807-879
18. Meggido N. Combinatorial optimization with rational objective functions. Math. Oper. Res. 4 (1979) 414-424
19. Nowicki E. An approximation algorithm for a single machine scheduling problem with release times, delivery times and controllable processing times. European J. Oper. Res. 72 (1994) 74-81
20. Nowicki E., and Zdrzałka S. A survey of results for sequencing problems with controllable processing times. Discrete Appl. Math. 26 (1990) 271-287
21. Smith W.E. Various optimizers for single stage production. Naval Res. Logist. Quart. 3 (1956) 59-66
22. Strusevich V.A. Two machine flow shop scheduling problem with no-wait in process: controllable machine speeds. Discrete Appl. Math. 59 (1995) 75-86
23. van Hoesel C.P.M., Wagelmans A.P.M., and van Vliet M. An O (n log n) algorithm for the two-machine flow shop problem with controllable machine speeds. INFORMS J. Comput. 8 (1996) 376-382
24. Van Wassenhove L.N., and Baker K.R. A bicriterion approach to time/cost tradeoffs in sequencing. European J. Oper. Res. 11 (1982) 48-54
25. Yuan J. The NP-hardness of the single machine common due date weighted tardiness problem. Systems Sci. Math. Sci. 5 (1992) 328-333