From fluid relaxations to practical algorithms for high-multiplicity job-shop scheduling: The holding cost objective

Operations Research

Volumn 51, Issue 5, 2003, Pages

  Bertsimas, Dimitris ^a   Gamarnik, David ^b   Sethuraman, Jay ^c  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c Columbia University ^*  (United States)

Author keywords

Production scheduling, deterministic: approximation algorithms for deterministic job shops; Queues, optimization: asymptotically optimal solutions to queueing networks

Indexed keywords

DISCRETE NETWORKS; FLUID RELAXATIONS; QUEUES; SUPPLY CHAIN OPERATIONS;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; COSTS; ERROR ANALYSIS; HEURISTIC METHODS; JOB ANALYSIS; OPTIMIZATION; PROBLEM SOLVING; QUENCHING;

SCHEDULING;

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

References (21)

1. Anderson, E. J., P. Nash. 1987. Linear Programming in Infinite-Dimensional Spaces. John Wiley and Sons, New York.
2. Atkins, D., H. Chen. 1995. Performance evaluation of scheduling control of queueing networks: Fluid model heuristics. Queueing Systems Appl. 21 391-413.
3. Avram, F., D. Bertsimas, M. Ricard. 1995. Fluid models of sequencing problems in open queueing networks: An optimal control approach. F. P. Kelly, R. J. Williams, eds. Stochastic Networks. Proc. Internat. Math. Assoc., Vol. 71. Springer-Verlag, New York, 199-234.
4. Bertsimas, D., D. Gamarnik. 1999. Asymptotically optimal algorithms for job shop scheduling and packet routing. J. Algorithms 33(2) 296-318.
5. _, J. Sethuraman. 2002. From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective. Math. Programming 92(1) 61-102.
6. Chen, H., D. Yao. 1993. Dynamic scheduling of a multiclass fluid network. Oper. Res. 41(6) 1104-1115.
7. Dai, J. G. 1995. On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models. Ann. Appl. Probab. 5 49-77.
8. _, G. Weiss. 2002. A fluid heuristic for minimizing makespan in job shops. Oper. Res. 50(4) 692-707.
9. Eng, D., J. Humphrey, S. P. Meyn. 1996. Fluid network models: Linear programs for control and performance bounds. 13th World Congress Intern. Fed. Automatic Control. San Francisco, CA.
10. Hall, L. 1997. Approximation algorithms for scheduling. D. Hochbaum, ed. Approximation Algorithms for NP-Hard Problems. PWS Publishing Company, Boston, MA.
11. _, A. S. Schulz, D. B. Shmoys, J. Wein. 1997. Scheduling to minimize average completion time: Off-line and on-line approximation algorithms. Math. Oper. Res. 22(3) 513-544.
12. Harrison, J. M. 1996. The bigstep approach to flow management in stochastic processing networks. F. P. Kelly, S. Zachary, I. Ziedins, eds. Stochastic Networks: Theory and Applications. Clarendon Press, Oxford, U.K., 57-90.
13. Hoogeveen, H., P. Schuurman, G. Woeginger. 1998. Non-approximability results for scheduling problems with minsum criteria. R. E. Bixby, E. A. Boyd, R. Z. Rios-Mercado, eds. Integer Programming and Combinatorial Optimization (IPCO-VI Proceedings). Lecture Notes in Computer Science, Vol. 1412. Springer-Verlag, New York, 353-366.
14. Karger, D., C. Stein, J. Wein. 1999. Scheduling algorithms. M. J. Atallah, ed. Algorithms and Theory of Computation Handbook. CRC Press, Boca Raton, FL.
15. Luo, X., D. Bertsimas. 1999. A new algorithm for state-constrained separated continuous linear programs. SIAM J. Control Optim. 37(1) 177-210.
16. Maglaras, C. 2000. Discrete-review policies for scheduling stochastic networks: Trajectory tracking and fluid-scale asymptotic optimality. Ann. Appl. Probab. 10(3) 897-929.
17. Meyn, S. P. 1997a. The policy improvement algorithm for Markov decision processes with general state space. IEEE Trans. Automatic Control 42(12) 1663-1680.
18. _. 1997b. Stability and optimization of queueing networks and their fluid models. G. G. Yin, Q. Zhang, eds. Mathematics of Stochastic Manufacturing Systems. Lectures in Appl. Math., Vol. 33. American Mathematical Society, Providence, RI, 175-200.
19. Pullan, M. C. 1993. An algorithm for a class of continuous linear programs. SIAM J. Control Optim. 31(6) 1558-1577.
20. Queyranne, M., M. Sviridenko. 1999. Approximation algorithms for shop scheduling problems with minsum criteria. Technical report, Faculty of Commerce, University of British Columbia, Vancouver, British Columbia, Canada.
21. Rybko, A. N., A. L. Stolyar. 1992. Ergodicity of stochastic processes describing the operations of open queueing networks. Problems Inform. Transmission 28 199-220.