Sequencing of jobs in some production system

European Journal of Operational Research

Volumn 125, Issue 3, 2000, Pages 535-550

  Grabowski, Jozef ^a   Pempera, Jaroslaw ^a  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONCRETE BLOCKS; CONCRETE INDUSTRY; CONSTRAINT THEORY; HEURISTIC METHODS; MATHEMATICAL MODELS; OPTIMIZATION;

HYBRID FLOW SHOP SCHEDULING PROBLEM; MAXIMUM COMPLETION TIME; TABU SEARCH;

SCHEDULING;

EID: 0034274968     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00224-6     Document Type: Article

References (13)

1. Gilmore P.C., Gomory R.E. Sequencing a one state variable machine. A solvable case of the travelling salesman problem. Operations Research. 12:1964;655-679.
2. Glover F. Tabu search part I. ORSA Journal on Computing. 1:1989;190-206.
3. Glover F. Tabu search part II. ORSA Journal on Computing. 2:1990;4-32.
4. Grabowski J. Algorithm of solving the travelling salesman problem by using disjunctive graph. Matematyka Stosowana. XII:1978;81-98. Polish.
5. Grabowski J., Skubalska E., Smutnicki C. On flow shop with release and due dates to minimize maximum lateness. Journal of the Operational Research Society. 34:1983;615-620.
6. Grabowski J., Nowicki E., Zdrzalka S. A block approach for single-machine scheduling with release dates and due dates. European Journal of Operational Research. 26:1986;278-285.
7. Hall N.G., Sriskandarajanh C.A. Survey of machine scheduling problems with blocking and no-wait in process. Operations Research. 44:1996;510-525.
8. Nowicki E., Smutnicki C. A fast tabu search algorithm for the permutation flow shop problem. European Journal of Operational Research. 91:1996;160-175.
9. Rajedran C. A no wait flow shop scheduling heuristic to minimize makespan. Journal of the Operational Research Society. 45:1994;472-478.
10. Smutnicki C. Some properties of scheduling problem with storing constraints. Zeszyty Naukowe AGH: Automatyka. 34:1983;223-232. (in Polish).
11. Smutnicki C. Block approach in flow-shop scheduling problem with storing constraints. Zeszyty Naukowe Politechniki Slaskiej: Automatyka. 84:1986;223-233. (in Polish).
12. Taillard E. Some efficient heuristic methods for flow shop sequencing. European Journal of Operational Research. 47:1990;65-74.
13. Widmer M., Hertz A. A new heuristic method for flow shop problem sequencing problems. European Journal of Operational Research. 41:1989;186-193.