Parallel machine scheduling, linear programming, and parameter list scheduling heuristics

Operations Research

Volumn 46, Issue 5, 1998, Pages 729-741

  Chan, Lap Mui Ann ^a   Muriel, Ana ^b   Simchi Levi, David ^c  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF MICHIGAN   (United States)

^c NORTHWESTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC METHODS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; OPERATIONS RESEARCH; OPTIMIZATION; PARAMETER ESTIMATION; PROBABILITY; PROBLEM SOLVING;

COMPLETION TIME MODEL; LINEAR PROGRAMMING RELAXATION; PARALLEL MACHINE SCHEDULING; PARAMETER LIST SCHEDULING HEURISTICS; SET PARTITIONING FORMULATION; TIME DISCRETIZED FORMULATION;

SCHEDULING;

EID: 0032154566     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.46.5.729     Document Type: Article

References (12)

1. VAN DEN AKKER, J. M. 1994. LP-Based Solution Methods for Single-Machine Scheduling Problems. Ph.D. Thesis, Eindhoven University of Technology, Eindhoven, The Netherlands.
2. VAN DEN AKKER, J. M., J. A. HOOGEVEEN, AND S. L. VAN DE VELDE. 1995. Parallel Machine Scheduling by Column Generation. Proceedings of the 4th Twente Workshop on Graphs and Combinatorial Optimization. U. Faigle and C. Hoede (eds.). (Also appeared as a working paper, Eindhoven University, Memorandum COSOR 95-35.)
3. BRAMEL, J. AND D. SIMCHI-LEVI. 1997. On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem. Opus. Res. 45, 295-301.
4. CHAKRABARTI, S., C. A. PHILLIPS, A. S. SCHULZ, D. B. SCHMOYS, C. STEIN, AND J. WEIN. 1996. Improved Scheduling Algorithms for Minsum Criteria. In Automata, Languages and Programming. F. Meyer auf der Heide and B. Monien (eds.), number 1099 in Lecture Notes in Computer Science. Springer, Berlin. Proceedings of the 23rd International Colloquium (ICALP '96).
5. CHAN, L., D. SIMCHI-LEVI, AND J. BRAMEL. 1994. Worst-Case Analyses, Linear Programming and the Bin-Packing Problem. To appear in Math. Programming.
6. CHANDRA, A. AND C. WONG. 1975. Worst-Case Analysis of a Placement Algorithm Related to Storage Allocation. SIAM J. Comput. 4, 3, 249-263.
7. COFFMAN, E. G. JR. AND G. S. LUEKER. 1991. Probabilistic Analysis of Packing and Partitioning Algorithms. John Wiley & Sons Ltd., New York.
8. DESROCHERS, M, J. DESROSIERS, AND M. SOLOMON. 1992. A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows. Opns. Res. 40, 342-354.
9. DYER, M. AND L. WOLSEY. 1990. Formulating the Single Machine Sequencing Problem with Release Dates as a Mixed Integer Program. Discrete Appl. Math. 26, 255-270.
10. EASTMAN, W., S. EVEN, AND I. ISAACS. 1964. Bounds for the Optimal Scheduling of n Jobs on m Processors. Mgmt. Sci. 11, 2, 268-279.
11. SOUSA, J. P. 1989. Time Indexed Formulations of Non-Preemptive Single-Machine Scheduling Problems. Ph.D. Thesis, Université Catholique de Louvain, Belgium.
12. SOUSA, J. P. AND L. A. WOLSEY. 1992. A Time-Indexed Formulation of Non-Preemptive Single machine Scheduling Problems. Math. Programming 54, 353-367.