A variant of the permutation flow shop model with variable processing times

Discrete Applied Mathematics

Volumn 76, Issue 1-3, 1997, Pages 123-140

  Finke, G ^a   Jiang, H ^a  

^a Laboratoire Leibniz   (France)

Author keywords

Flow shop scheduling; Greedy algorithm; Makespan minimization; Variable processing times

Indexed keywords

EID: 0002584119     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(96)00121-7     Document Type: Article

References (20)

1. B. Alidaee, Single machine scheduling with nonlinear cost functions, Computers and Oper. Res. 18 (1991) 317-322.
2. J. Blazewicz, W. Cellary, R. Slowinski and J. Weglarz, Scheduling under Resource Constraints: Deterministic Models, (J. C. Baltzer, Basel, 1986).
3. J. Blazewicz, K. Ecker, G. Schmidt and J. Weglarz, Scheduling in Computer and Manufacturing Systems, (Springer, Berlin, 1993).
4. R.L. Daniels and J.B. Mazzola, Flow shop scheduling with resource flexibility, Oper. Res. 48 (1994) 504-522.
5. M. Dror, H.J. Stern and J.K. Lenstra, Parallel machine scheduling with processing rates dependent on number of jobs in operation, Management Sci. 33 (1987) 1001-1009.
6. G. Finke and H. Jiang, Permutation flow-shops with state-dependent processing times, in: Proceeding of the International Conference on Industrial Engineering and Production Management, Marrakech (1995) 285-294.
7. G.C. Gilmore and R.E. Gomory, Sequencing a one state variable machine: a solvable case of the traveling salesman problem, Oper. Res. 12 (1964) 655-679.
8. J.N.D. Gupta and S.K. Gupta, Single facility scheduling with nonlinear processing times, Comput. Ind, Engng 14 (4) (1988) 387-393.
9. N.G. Hall and S. Sriskandarajah, Machine scheduling problems with blocking and no-wait in process, Toronto, Working Paper 91-05 (1991).
10. A. Janiak, Flow-shop scheduling with controllable operation processing times, in: H. P. Geering and M. Mansour, eds., Large Scale Systems: Theory and Applications, (Pergamon Oxford, 1986) 602-605.
11. A. Janiak, Minimization of the total resource consumption in permutation flow-shop sequencing subject to a given makespan, J. Modell Simul Control 13 (1988) 1-11.
12. A. Janiak, General flow-shop scheduling with resource constraints, Internat. J. Production Res. 26 (1988) 1089-1103.
13. A. Janiak, Minimization of resource consumption under a given deadline in two-processor flow-shop scheduling problem, Inform. Process. Lett. 32 (1989) 101-112.
14. S.M. Johnson, Optimal two- and three-stage production schedules with setup times included, Naval Res. Logis. Quart. 1 (1954) 61-68.
15. J. Józefowska and J. Weglarz, On some discrete-continuous scheduling problems, Research Report RA-94/003 Poznan University of Technology (October 1994).
16. W. Kubiak and S.L. van de Velde, Scheduling deteriorating jobs to minimize makespan, Report LPOM-94-12, University of Twente, Enschede, The Netherlands, (October 1994).
17. C. Sriskandarajah and S.K. Goyal, Scheduling of a two-machine flowshop with processing time linearly dependent on job waiting-time, J. Oper. Res. Soc. 40 (1989) 907-921.
18. C. Sriskandarajah and E. Wagneur, Hierarchical control of the two processor flow-shop with state-dependent processing times: Complexity analysis and approximate algorithms, INFOR 29 (1991) 193-205.
19. E. Wagneur and C. Sriskandarajah, The two-machine permutation flow shop with state-dependent processing times, Naval Res. Logist. 40 (1993) 697-717.
20. E. Wagneur and C. Sriskandarajah, Optimal control of a class of DEDS: Flow-shops with statedependent processing times, Discrete Event Dynamic Systems: Theory Appl. 3 (1993) 397-425.