Scheduling jobs on several machines with the job splitting property

Operations Research

Volumn 44, Issue 4, 1996, Pages 617-628

  Serafini, Paolo ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; LINEAR PROGRAMMING; LOOMS; MATHEMATICAL MODELS; OPTIMIZATION; SCHEDULING;

JOB SPLITTING PROPERTY; POLYNOMIAL TIME ALGORITHMS; UNORDERED LEXICO OPTIMA;

PRODUCTION CONTROL;

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

References (13)

1. BLAZEWICZ, J., M. DRABOWSKI, AND J. WEGLARZ. 1986. Scheduling Multiprocessor Tasks to Minimize Schedule Length. IEEE Trans. Computers C-35 5, 389-393.
2. FEDERGRUEN, A. AND H. GROENEVELT. 1986. Preemptive Scheduling of Uniform Machines by Ordinary Network Flow Techniques. Mgmt. Sci. 32, 341-349.
3. GOLDBERG, A. V., S. A. PLOTKIN, AND E. TARDOS. 1991. Combinatorial Algorithms for the Generalized Circulation Problem. Math. Ons. R. 16, 351-381.
4. HORN, W. A. 1974. Some Simple Scheduling Algorithms. Naval Res. Logist. Quart. 21, 177-185.
5. HU, T. C. 1970. Integer Programming and Network Flows. Addison-Wesley, Reading, Mass.
6. LABETOULLE, J., E. L. LAWLER, J. K. LENSTRA, AND A. H. G. RINNOOY KAN. 1984. Preemptive Scheduling of Uniform Machines Subject to Release Dates. In Progress in Combinatorial Optimization, W. R. Pulleyblank (ed.), Academic Press, New York, 245-261.
7. LAWLER, E. 1983. Recent Results in the Theory of Machine Scheduling. In Mathematical Programming: The State of the Art, A. Bachem, M. Grötschel, and B. Körte (eds.), Springer, Berlin, 202-234.
8. MASCHLER, M. 1992. The Bargaining Set, Kernel, and Nucleolus. In Handbook of Game Theory, with Economic Applications, Vol. I, R. J. Aumann and S. Hart (eds.), North-Holland, Amsterdam, 591-667.
9. MASCHLER, M., B. PELEG, AND L. S. SHAPLEY. 1979. Geometric Properties of the Kernel, Nucleoulus, and Related Solution Concepts. Math. Ons. R. 4, 303-338.
10. PICARD, J. C. AND M. QUEYRANNE. 1980. On the Structure of all Minimum Cuts in a Network and Applications. Math. Prog. Study 13, 8-16.
11. SCHRAGE, L. 1991. LINDO: An Optimization Modeling System, Fourth Edition, Scientific Press, San Francisco, Calif.
12. SLOWINSKI, R. 1984. Preemptive Scheduling of Independent Jobs on Parallel Machines Subject to Financial Constraints. Eur. J. Opnl. Res. 15, 366-373.
13. SLOWINSKI, R. 1988. Production Scheduling on Parallel Machines Subject to Staircase Demands. Eng. Costs and Prod. Economics 14, 11-17.