Optimal sequences in stochastic single machine shops

Computers and Operations Research

Volumn 23, Issue 7, 1996, Pages 705-721

  Soroush, H M ^a,b  

^a CLEMSON UNIVERSITY   (United States)

^b KUWAIT UNIVERSITY   (Kuwait)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEQUENCES; JOB ANALYSIS; MATHEMATICAL MODELS; OPERATIONS RESEARCH; RANDOM PROCESSES; SCHEDULING;

CLASSICAL SINGLE MACHINE MODEL; COST FUNCTION; OPTIMAL SEQUENCES; STOCHASTIC SINGLE MACHINE SHOPS;

OPTIMIZATION;

EID: 0030193240     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/0305-0548(95)00069-0     Document Type: Article

References (63)

1. K. R. Baker, Introduction to Sequencing and Scheduling. John Wiley, New York (1974).
2. R. W. Conway, W. L. Maxwell and L. W. Miller, Theory of Scheduling. Addison-Wesley, Reading, MA (1967).
3. K. R. Baker and G. D. Scudder, Sequencing with earliness and tardiness penalties: a review. Ops Res. 38, 22-36 (1990).
4. U. Bagchi, R. Sullivan and Y. Chang, Minimizing mean squared deviation of completion times about a common due date. Mgt Sci. 33, 894-906 (1987).
5. P. De, J. B. Ghosh and C. E. Wells, A note on the minimization of mean squared deviation of completion times about a common due date. Mgt Sci. 35, 1143-1147 (1989).
6. T. Sen, P. Dileepan and B. Ruparel, Minimizing a generalized quadratic penalty function of job completion times: an improved branch-and-bound approach. Engng Costs Production Econ 18, 197-202 (1990).
7. W. Szwarc, Parametric precedence relations in single machine scheduling. Op Res. Lett 9, 133-140 (1990).
8. W. Townsend, The single machine problem with quadratic penalty function of completion times: a branch-and-bound solution. Mgt Sci. 24, 530-534 (1978).
9. V. Vani and M. Raghavachari, Deterministic and random single machine sequencing with variance minimization. Op Res. 35, 111-120 (1987).
10. D. J. Hoitomt, P. B. Luh and K. R. Pattipati, A practical approach to job-shop scheduling problems. IEEE Trans Robotics Automation 9, 1-13 (1993).
11. B. Alidaee, Single machine scheduling with nonlinear cost functions. Computers Ops Res. 18, 317-322 (1991).
12. H. Emmons, One machine sequencing to minimize certain functions of job tardiness. Ops Res. 17, 701-715 (1969).
13. P. B. Henderson and K. Steiglitz, A problem in single-machine sequencing with nonlinear delay costs. Mgmt Sci. 22, 1342-1350 (1976).
14. M. Raghavachari, Schedulng problems with nonlinear penalty functions - a review. Ops Res. 25, 141-164 (1988).
15. A. H. G. Rinnooy Kan, B. J. Lageweg and J. K. Lenstra, Minimizing total costs in one-machine scheduling. Ops Res. 23, 908-927 (1975).
16. R. R. Weber, P. Varaiya and J. Walrand, Scheduling jobs with stochastically ordered processing times on parallel machines to minimize flow time. J. Appl. Probability 23, 841-847 (1986).
17. K. N. McKay, F. R. Safayeni and J. A. Buzacott, Job-shop scheduling theory: what is relevant? Interfaces 18, 84-90 (1988).
18. S. G. Taylor and S. F. Bolander, Process flow scheduling principles. Production Inventory Mgmt J. 32, 67-71 (1991).
19. S. E. Fawcett and J. N. Pearson, Understanding and applying constraint management in today's manufacturing environments. Production Inventory Mgmt J. 32, 46-55 (1991).
20. M. M. Umble and M. L. Srikanth, Synchronous Manufacturing. South-Western, Cincinnati, OH (1990).
21. M. L. Pinedo, Stochastic scheduling with release and due dates. Op Res. 21, 559-572 (1983).
22. P. De, J. B. Ghosh and C. E. Wells, On the minimization of the weighted number of tardy jobs with random processing times and deadline. Computers Ops Res 18, 457-463 (1991).
23. S. J. Balut, Scheduling to minimize the number of late jobs when set-up and processing times are uncertain. Mgmt Sci. 19, 1283-1288 (1973).
24. H. Kise and T. Ibaraki, On Balut's algorithm and NP-completeness for a chance-constrained scheduling problem. Mgmt Sci. 29, 384-388 (1983).
25. O. J. Boxma and F. G. Forst, Minimizing the expected weighted number of tardy jobs in stochastic flow shops. Op. Res. Lett. 5, 119-126 (1986).
26. S. C. Sarin, E. Erel and G. Steiner, Sequencing jobs on a single machine with a common due date and stochastic processing times. Eur. J. Opl Res. 51, 188-198 (1991).
27. B. V. Cadambi, One machine scheduling to minimize expected mean tardiness - Part I. Computers Ops. Res. 18, 787-796 (1991).
28. S. Chakravarthy, A single machine scheduling problem with random processing times. Naval Res. Logistics Q. 33, 391-397 (1986).
29. T. B. Crabill and W. L. Maxwell, Single machine scheduling with random processing times and random due dates. Naval Res. Logistic Q. 19, 549-555 (1969).
30. H. M. Soroush and L. D. Fredendall, The stochastic single machine scheduling problem with earliness and tardiness costs. Eur. J. Opl Res. 77, 287-302 (1994).
31. R. L. Keeney and H. Raiffa, Decisions with Multiple Objectives: Preferences and Value Tradeoffs. John Wiley, New York (1976).
32. H. Raiffa, Decisions Analysis. Addison-Wesley, Reading, MA (1970).
33. C. Buyukkoc, P. Varaiya and J. Walrand, The cμ rule revisited. Adv. Appl. Probability 17, 237-238 (1985).
34. T. Kämpke, Optimal scheduling of jobs with exponential service times on identical parallel processors. Op. Res. 37, 126-133 (1989).
35. G. Weiss, Multiserver stochastic scheduling. In Deterministic and Stochastic Scheduling, (Edited by M. A. H. Dempster, J. K. Lenstra and A. H. G. Rinnooy Kan), pp. 157-179. Reidel, Dordrecht (1982).
36. A. D. Amar and J. N. D. Gupta, Simulated versus real life data in testing the efficiency of scheduling algorithsms. IIE Transactions 18, 16-25 (1986).
37. D. J. White, Dynamic Programming. Holden-Day, San Francisco, CA (1969).
38. G. R. Shorak, Algorithm and analog computers for the most reliable route through a network. Ops Res. 12, 632-633 (1964).
39. W. L. Winston, Operations Research: Applications and Algorithms. Duxbury, Belmont, CA (1991).
40. L. J. Moore, S. M. Lee and B. W. Taylor III, Management Science Allyn and Bacon, Needham Heights, MA (1993).
41. T. C. Koopmans and M. Beckmann, Assignment problems and the location of economic activities. Econometrica 25, 53-76 (1957).
42. L. Steinberg, The backward wiring problem: a placement algorithm. SIAM Rev. 3, 37-50 (1961).
43. F. S. Hillier, Quantitative tools for plant layout analysis. J. Ind. Engng 14, 33-40 (1963).
44. A. N. Elshafei, Hospital layout as a quadratic assignment problem. Opl Res. Q. 28, 167-179 (1977).
45. G. Laporte and H. Mercure, Balancing hydraulic turbine runners: a quadratic assignment problem. Eur. J. Opl Res. 35, 378-381 (1988).
46. J. Krarup and P. M. Pruzan, Computer-aided layout design. Mathematic Programming Study 9 (Edited by M. L. Balinski and C. Lemarechal), pp. 75-94. North Holland, Amsterdam (1978).
47. R. E. Burkard, Quadratic assignment problems. Eur. J. Opl Res. 15, 283-289 (1984).
48. T. A. Johnson, New Linar programming-based solution procedures for the quadratic assignment problem. Ph.D. Dissertation, Clemson University, Clemson, SC (1992).
49. S. Sahni and T. Gonzalez, P-complete approximation problems. J. Assoc. Computing Machinery 23, 555-565 (1976).
50. P. C. Gilmore, Optimal and suboptimal algorithms for the quadratic assignment problem. J. Soc. Ind. Appl Math. 10, 305-313 (1962).
51. G. W. Grave and A. B. Whinston, An algorithm for the quadratic assignment problem. Mgmt Sci. 17, 453-471 (1970).
52. R. E. Burkard and K. H. Stratmann, Numerical investigations on quadratic assignment problems. Naval Res. Logistic Q. 25, 129-148 (1978).
53. A. M. Frieze and J. Yadegar, On the quadratic assignment problem. Discrete App. Math. 5, 89-98 (1983).
54. R. S. Liggett, The quadratic assignment problem: an experimental evaluation of solution strategies. Mgt Sci. 27, 442-458 (1981).
55. M. R. Wilhelm and T. L. Ward, Solving quadratic assignment problems by simulated annealing. IIE Trans. 19, 107-119 (1987).
56. H. D. Sherali and P. Rajgopal, A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem. Computers Ops Res. 13, 587-600 (1986).
57. C. L. Huntley and D. E. Brown, A parallel heuristic for quadratic assignment problems. Computers Ops Res. 18, 275-289 (1991).
58. W. P. Adams and T. A. Johnson, Improved linear programming-based lower bounds for the quadratic assignment problem. DIMACS Ser. (AMS) 16, 43-75 (1994).
59. L. Kaufman and F. Broeckx, An algorithm for the quadratic assignment problem using Benders' decomposition. Eur. J. Ops Res. 2, 204-211 (1978).
60. M. S. Bazaraa and H. D. Sherali, Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem. Naval Res. Logistic Q. 27, 29-41 (1980).
61. J. W. M. Bertrand, The use of workload information to control job lateness in controlled and uncontrolled release production systems. J. Ops Mgmt 3, 79-92 (1983).
62. J. Bruno, P. Downet and G. N. Frederickson, Sequencing tasks with exponential service times to minimize the expected flow time or makespan. J. Assoc. Computing Machinery 28, 100-113 (1981).
63. G. Weiss and M. Pinedo, Scheduling tasks with exponential service times on non-identical processors to minimize various cost functions. J. Appl. Probability 17, 187-202 (1980).