Scheduling with controllable release dates and processing times: Total completion time minimization

European Journal of Operational Research

Volumn 175, Issue 2, 2006, Pages 769-781

  Cheng, T C Edwin ^a   Kovalyov, Mikhail Y ^b   Shakhlevich, Natalia V ^c  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b BELARUSIAN STATE UNIVERSITY   (Belarus)

^c UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

Controllable processing times; Controllable release dates; Due date scheduling; Parallel machines; Scheduling; Single machine; Total completion time

Indexed keywords

DATA COMPRESSION; DATA REDUCTION; OPERATIONS RESEARCH; PROBLEM SOLVING;

CONTROLLABLE PROCESSING TIMES; CONTROLLABLE RELEASE DATES; DUE-DATE SCHEDULING; PARALLEL MACHINES; SINGLE MACHINE; TOTAL COMPLETION TIME;

SCHEDULING;

EID: 33748430703     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.06.072     Document Type: Article

References (22)

1. Cheng T.C.E., and Janiak A. Resource optimal control in some single-machine scheduling problems. IEEE Transactions on Automatic Control 39 (1994) 1243-1246
2. Cheng T.C.E., Janiak A., and Kovalyov M.Y. Bicriterion single-machine scheduling with resource dependent processing times. SIAM Journal on Optimization 8 (1998) 617-630
3. T.C.E. Cheng, M.Y. Kovalyov, N.V. Shakhlevich, Scheduling with controllable release dates and processing times: Makespan minimization, European Journal of Operational Research, this issue, doi:10.1016/j.ejor.2005.06.021.
4. Cheng T.C.E., Oguz C., and Qi X.D. Due-date assignment and single machine scheduling with compressible processing times. International Journal of Production Economics 43 (1996) 107-113
5. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5 (1979) 287-326
6. Janiak A. Time-optimal control in a single machine problem with resource constraints. Automatica 22 (1986) 745-747
7. Janiak A. Scheduling independent one-processor tasks with linear models of release dates under a given maximum schedule length to minimize resource consumption. Journal of System Analysis-Modelling-Simulation 7 (1990) 885-890
8. Janiak A. Single machine scheduling problem with a common deadline and resource dependent release dates. European Journal of Operational Research 53 (1991) 317-325
9. Janiak A. Single machine sequencing with linear models of release dates. Naval Research Logistics 45 (1998) 99-113
10. Janiak A. Minimization of the makespan in a two-machine problem under given resource constraints. European Journal of Operational Research 107 (1998) 325-357
11. Janiak A., and Kovalyov M.Y. Single machine scheduling subject to deadlines and resource dependent processing times. European Journal of Operational Research 94 (1996) 284-291
12. Janiak A., and Li C.L. 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
13. Hall N.G., Kubiak W., and Sethi S.P. Earliness-tardiness scheduling problems, II: Deviation of completion times about a restrictive common due date. Operations Research 39 (1991) 847-856
14. Hoogeveen J.A., and van de Velde S.L. Scheduling around a small common due date. European Journal of Operational Research 55 (1991) 237-242
15. Li C.L. Scheduling with resource-dependent release dates-a comparison of two different resource consumption functions. Naval Research Logistics 41 (1994) 807-819
16. Li C.L. Scheduling to minimize the total resource consumption with a constraint on the sum of completion times. European Journal of Operational Research 80 (1995) 381-388
17. Li C.L., Sewell E.C., and Cheng T.C.E. Scheduling to minimize release-time resource consumption and tardiness penalties. Naval Research Logistics 42 (1995) 949-966
18. Liman S.D., Panwalkar S.S., and Thongmee S. A single machine scheduling problem with common due window and controllable processing times. Annals of Operations Research 70 (1997) 145-154
19. Nowicki E., and Zdrzalka S. A survey of results for sequencing problems with controllable processing times. Discrete Applied Mathematics 26 (1990) 271-287
20. Panwalkar S.S., and Rajagopalan R. Single-machine sequencing with controllable processing times. European Journal of Operational Research 59 (1992) 298-302
21. N.V. Shakhlevich, V.A. Strusevich, Single machine scheduling with controllable release and processing parameters, Discrete Applied Mathematics, in press.
22. Wan G., Yen B.P.C., and Li C.L. Single machine scheduling to minimize total compression plus weighted flow cost is NP-hard. Information Processing Letters 79 (2001) 273-280