The no-wait two-machine flow shop scheduling problem with convex resource-dependent processing times

IIE Transactions (Institute of Industrial Engineers)

Volumn 39, Issue 5, 2007, Pages 539-557

  Shabtay, Dvir ^a   Kaspi, Moshe ^a   Steiner, George ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b MCMASTER UNIVERSITY   (Canada)

Author keywords

Convex resource consumption function; Flow shop scheduling; No wait; Series parallel graph; TSP on k root cost matrices

Indexed keywords

HEURISTIC PROGRAMMING; OPTIMAL SYSTEMS; RESOURCE ALLOCATION; SEQUENTIAL MACHINES; WORK SIMPLIFICATION;

CONVEX RESOURCE CONSUMPTION FUNCTION; FLOW SHOP SCHEDULING; SERIES-PARALLEL GRAPH; TRAVELING SALESMAN PROBLEM (TSP);

SCHEDULING ALGORITHMS;

EID: 33847713661     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408170601181674     Document Type: Article

References (36)

1. Alidaee, B. and Ahmadian, A. (1993) Two parallel machine sequencing problems involving controllable job processing times. European Journal of Operational Research, 70, pp. 335-341.
2. Armstrong, R.,.Gu, S. and Lei, L. (1995) An algorithm for the two-resource allocation problem with a non-differentiable convex objective function. Journal of the Operational Research Society, 46, pp. 116-122.
3. Armstrong, R.,.Gu, S. and Lei, L. (1997) Solving a class of two-resource allocation problems by equivalent load method. Journal of the Operational Research Society, 48, pp. 818-825.
4. Burdyuk, R. E. and Trofimov, V. N. (1976) Generalization of the results of Gilmore and Gomory on the solution of the traveling salesman problem. Cybernetics, 14, pp. 12-18.
5. Burkard, R. E. and Deǐneko, V. G. (1995) Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood. Computing, 54:3, pp. 191-212.
6. Burkard, R. E.,.Klinz, B. and Rudolf, R. (1996) Perspectives of Monge properties in optimization. Discrete Applied Mathematics, 70:2, pp. 95-161.
7. Burkard, R. E.,.Deǐneko, G. V.,.Van Dal, R.,.Van Der Veen, J. A. A. and Woeginger, J. (1998) Well-solvable special cases of the traveling salesman problem: A survey. SIAM Review, 40:3, pp. 496-546.
8. Chen, B.,.Potts, C. N. and Woeginger, G. J. (1998) A review of machine scheduling: Complexity and approximability. Handbook of Combinatorial Optimization, pp. 21-169. Kluwer, Dordrecht, The Netherlands
9. Cheng, T. C. E. and Kovalyov, M. Y. (1995) Single machine batch scheduling with deadlines and resource dependent processing times. Operations Research Letters, 17, pp. 243-249.
10. Cheng, T. C. E.,.Janiak, A. and Kovalyov, M. Y. (1998) Bicriterion single machine scheduling with resource dependent processing times. SIAM Journal on Optimization, 8:2, pp. 617-630.
11. Cheng, T. C. E. and Janiak, A. (2000) A permutation flow-shop scheduling problem with convex models of operation processing times. Annals of Operations Research, 96, pp. 39-60.
12. Daniels, R. L. and Sarin, R. K. (1989) Single machine scheduling with controllable processing times and number of jobs tardy. Operations Research, 37:6, pp. 981-984.
13. Gilmore, P. C. and Gomory, R. E. (1964) A solvable case of the traveling salesman problem. Operations Research, 12, pp. 655-679.
14. Gilmore, P. C.,.Lawler, E. L. and Shmoys, D. B. (1985) Well-solved special cases of the traveling salesman problem. The Traveling Salesman Problem, Wiley, Chichester
15. Janiak, A. (1987) One-machine scheduling with allocation of continuously-divisible resource and with no precedence constraints. Kybernetika, 23:4, pp. 289-293.
16. Janiak, A. (1989) Minimization of the resource consumption under a given dead-line in the two-processor flow-shop scheduling problem. Information Processing Letters, 32, pp. 101-112.
17. Janiak, A. (1998) Minimization of the makespan in a two-machine problem under given resource constraints. European Journal of Operational Research, 107, pp. 325-337.
18. Janiak, A. and Kovalyov, M. Y. (1996) Single machine scheduling subject to deadlines and resource dependent processing times. European Journal of Operational Research, 94, pp. 284-291.
19. Janiak, A. and Szkodny, T. (1994) Job-shop scheduling with convex models of operations. Mathematical and Computer Modelling, 20, pp. 59-68.
20. Karush, W. (1939) Minima of functions of several variables with inequalities as side conditions, Department of Mathematics, University of Chicago, Chicago, IL
21. Kuhn, H. W. and Tucker, A. W. (1951) Nonlinear programming. Proceedings of the 2nd Berkeley Symposium on Mathematical Statistics and Probability University of California Press, pp. 481-492. University of California Press, Berkeley, CA
22. Monma, C. L.,.Schrijver, A.,.Todd, M. J. and Wei, V. K. (1990) Convex resource allocation problems on directed acyclic graphs: Duality, complexity, special cases and extensions. Mathematics of Operations Research, 15, pp. 736-748.
23. Ng, C. T. D.,.Cheng, T. C. E.,.Kovalyov, M. Y. and Lam, S. S. (2003) Single machine scheduling with a variable common due date and resource-dependent processing times. Computers and Operations Research, 30, pp. 1173-1185.
24. Nowicki, E. and Zdrzalka, S. (1990) A survey of results for sequencing problems with controllable processing times. Discrete Applied Mathematics, 26, pp. 271-287.
25. Papadimitriou, C. H. and Steiglitz, K. (1982) Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ
26. Park, J. K. (1991) A special case of the n-vertex traveling salesman problem that can be solved in O(n) time. Information Processing Letters, 40, pp. 247-254.
27. Plante, R. D.,.Lowe, T. J. and Chandrasekaran, R. (1987) The product matrix traveling salesman problem: An application and solution heuristic. Operations Research, 35:5, pp. 772-783.
28. Sahni, S. and Cho, Y. (1979) Complexity of scheduling shop with no wait in process. Mathematics of Operations Research, 4, pp. 448-457.
29. Sarvanov, V. I. (1980) On the complexity of minimizing a linear form on a set of cyclic permutations. Soviet Mathematics-Doklady, 22, pp. 118-120.
30. Scott, S. C. and Jefferson, T. R. (1995) Allocation of resources in project management. International Journal of Systems Science, 26:2, pp. 413-420.
31. Shabtay, D. (2004) Single and a two-resource allocation algorithms for minimizing the maximal lateness in a single machine-scheduling problem. Computers and Operations Research, 31:8, pp. 1303-1315.
32. Shabtay, D. and Kaspi, M. (2004) Minimizing the total weighted flow time in a single machine with controllable processing times. Computers and Operations Research, 31:13, pp. 2279-2289.
33. Shabtay, D. and Steiner, G. (2005) Single machine batch scheduling to minimize total completion time and resource consumption costs. Journal of Scheduling
34. Vairaktarakis, G. L. (2003) Simple algorithms for Gilmore-Gomory's traveling salesman and related problems. Journal of Scheduling, 6, pp. 499-520.
35. Vickson, R. G. (1980) Two single machine sequencing problems involving controllable job processing times. AIIE Transactions, 12:3, pp. 258-262.
36. van Wassenhove, L. and Baker, K. R. (1982) A bicriterion approach to time/cost trade-offs in sequencing. European Journal of Operational Research, 11, pp. 48-54.