Discrete time parallel-machine scheduling: A case of ship scheduling

Engineering Optimization

Volumn 26, Issue 4, 1996, Pages 287-294

  Kao, Chiang ^a   Lee, Hong Tau ^a  

^a NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

Author keywords

Integer programming; Scheduling

Indexed keywords

INTEGER PROGRAMMING; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS; SCHEDULING; SHIPS;

PARALLEL MACHINE SCHEDULING PROBLEMS; SHIP SCHEDULING PROBLEMS;

PROBLEM SOLVING;

EID: 0030358302     PISSN: 0305215X     EISSN: None     Source Type: Journal    
DOI: 10.1080/03052159608941123     Document Type: Article

References (19)

1. Cheng, T. C. E. and Sin, C. C. S. (1990) A state-of-the-art review of parallel-machine scheduling research. European J. Operational Res., 47, 271-292.
2. max preemptive due-date scheduling problem. Eng. Costs and Production Econ., 21, 43-49.
3. DeWerra, D. (1988) On the two-phase method for preemptive scheduling. European J. Operational Res., 37, 227-235.
4. Lawler, E. L. and Martel, C .U. (1989) Preemptive scheduling of two uniform machines to minimize the number of late jobs. Operations Res., 37, 314-318.
5. Alidaee, B. and Ahmadian, A. (1993) Two parallel machine sequencing problems involving controllable job processing times. European J. Operational Res., 70, 335-341.
6. Emmons, H. and Pinedo, M. (1990) Scheduling stochastic jobs with due dates on parallel machines. European J. Operational Res., 47, 49-55.
7. De, P. and Morton, T. E. (1980) Scheduling to minimize makespan on unequal parallel processors. Decision Sci., 11, 586-602.
8. Dror, M., Stern, H. I. and Lenstra, J. K. (1987) Parallel machine scheduling: Processing rates dependent on number of jobs in operations. Management Sci., 33. 1001-1009.
9. Crowder, H., Johnson, E. L. and Padberg, M. (1983) Solving large-scale zero-one linear programming problems. Operations Res., 31, 803-834.
10. Johnson, E. L., Kostreva, M. M. and Suhl, U. H. (1985) Solving 0-1 integer programming problems arising from large scale planning models. Operations Res., 33, 803-819.
11. Bulfin, R. L. and Parker, R. G. (1980) Scheduling jobs on two facilities to minimize makespan. Management Sci., 26, 202-214.
12. So, K. C. (1990) Some heuristics for scheduling jobs on parallel machines with setups. Management Sci., 36, 467-475.
13. Webster, S. T. (1983) A priority rule for minimizing weighted flow time in a class of parallel machine scheduling problems. European J. Operational Res., 70, 327-334.
14. Ronen, D. (1983) Cargo ships routing and scheduling: Survey of models and problems. European J. Operational Res., 12, 119-126.
15. Ronen, D. (1993) Ship scheduling: The last decade. European J. Operational Res., 71, 325-333.
16. Kao, C., Li, D. C., Wu, C. and Tsai, C. C. (1990) knowledge-based approach to the optimal dock arrangement. International J. Systems Sci., 21, 2209-2215.
17. Dogramaci, A. and Surkis, J. (1979) Evaluation of a heuristic for scheduling independent jobs on parallel identical processors. Management Sci., 25, 1208-1216.
18. Schrage, L. (1987) User's manual for LINDO, 3rd ed. The Scientific Press, Redwood City. CA.
19. Sahni, S. K. (1976) Algorithm for scheduling independent tasks. J. Asso. Computing Machinery, 23, 116-127.