Abstract
Giant telescopes need a very high quality pilot telescope to guide them. Similarly, we show here that advanced heuristics for large one machine problems for the weighted tardiness objective also benefit from outstanding guide heuristics. These advanced heuristics can be categorized as having middle or high computational requirements. In other applications, forward algorithms and planning horizon procedures have reduced problems that are high-order polynomial to a complexity that is linear or quadratic in the time horizon; we achieve this here as well for these advanced procedures. We first develop X-dispatch bottleneck dynamics heuristics that allow for inserted idleness which we use as guide heuristics (low computation); next we develop forward algorithm neighborhood search (middle computation) and tabu search methods (high computation). Extensive testing and comparisons with other heuristics are reported. Extensions to job shops and other objectives are planned.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Bibliography
Adams J., Balas E. and D. Zawack (1988) “The shifting bottleneck procedure for job shop scheduling,”Management Science34, 391–401.
Arrow K. and S. Karlin (1958) “Production over time at increasing marginal cost,”Studies in the Mathematical Theory of Inventory and Production. Stanford CA: Stanford University Press.
Carlier, J. (1982) “The One Machine Sequencing Problem,”European Journal of Operations Research 11,42–47.
Cyert R.M., and J.G. March ((1963)A Behavioral Theory of the Firm. Englewood Cliffs, N.J.: Prentice-Hall.
Dell’Amico, M. and Marco Trubian (1991) “Applying Tabu-Search to the Job Shop Scheduling Problem,” Politecnico di Milano, Italy
Della Croce, F., R. Tadei and G. Volta (1992) “A Genetic Algorithm for the Job Shop Problem,” D.A.I. Politecnico di Torino, Italy.
Glover, F. (1990) “Tabu Search: A Tutorial,”Interfaces 20, 74–94.
Glover, F. and M. Laguna (1989), “Target Analysis to Improve a Tabu Search Method for Machine Scheduling,” Advanced Knowledge Research Group, US West Advanced Technologies, Boulder Colorado.
Johnson, S. M. (1957) “Sequential Planning Over Time at Minimum Cost,”Management Science 4, 435–437.
Kanet, J. and Z. Zhou (1993) “A Decision Theory Approach to Priority Dispatching for Job Shop Scheduling,”, Production and Operations Management, 1993, forthcoming.
Lawrence, S. and T.E. Morton (1989) “Resource-Constrained Multiproject Scheduling with Tardy Costs: Comparing Myopic, Bottleneck, and Resource Pricing Heuristics,” Carnegie Mellon University. To appear in the European Journal of Operations Research
Lawrence, S. and T.E. Morton “Job Sequencing Via Multipass Dispatch Methods,” Work-in-Progress, GSIA, Carnegie Mellon University
Lundin, R. and T.E. Morton (1975) “Planning Horizons for the Dynamic Lot Size Model: Protective Procedures and Computational Results,” Operations Research 23, 711–734.
Manne, A. and A.F. Veinott Jr. (1967) “Optimal Plant Size with Arbitrary Increasing Time Paths of Demand ” Investments for Capacity Expansion. Size, Location, and Time-Phasing. MIT Press: Cambridge, MA.
Modigliani, F. and K. Cohen (1961) “The Role of Anticipations and Plans in Economic Behavior and Their Use in Economic Analysis and Forecasting,” Bureau of Economic and Business Research. University of Illinois, Urbana.
Modigliani, F. and F. Hohn (1955) “Production Planning over Time and the Nature of the Planning Horizon,” Econometrica 23, 46–66.
Morton, T.E. (1978) “Universal Planning Horizons for Generalized Convex Production Scheduling,” Operations Research 26, 1046–1058.
Morton, T.E. (1979) “Infinite Horizon Dynamic Programming Models--A Planning Horizon Formulation,” Operations Research 27,730–742.
Morton, T.E. (1981) “Forward Algorithms for Forward Thinking Managers,”Applications of Management Science Vol. I. JAI Press.
Morton, T. and D. Pentico “Comparing Myopic, OPT, and Bottleneck Dynamics Heuristics in a Generalized Flowshop,” Work-In-Progress, GSIA, Carnegie Mellon University
Morton, T. and D. Pentico (1993) Heuristic Scheduling Systems: With Applications to Production Systems and Project Management Wiley Series in Engineering and Technology Management, John Wiley & Sons, New York.
Morton, T. and W. Wecker (1977) “Discounting, Ergodicity, and Convergence of Markov Decision Processes,” Management Science 23,890–900.
Muth, J.F. and G.L. Thompson (1963) Industrial Scheduling Prentice Hall, Englewood Cliffs, N.J.
Ow, P.S., T.E. Morton (1988) “Filtered Beam Search in Scheduling,”International Journal of Production Research 26, 297–307
Van Laarhoven, P.J.M., E.H.L. Aarts and J.K. Lenstra (1992) “Job Shop Scheduling by Simulated Annealing,” Operations Research 40, 112–129.
Vepsalainen, A. and T.E. Morton (1988) “Improving Local Priority Rules with Global Leadtime Estimates,” Journal of Manufacturing and Operations Management 1, 102–118.
Zhou, Z and V. Sridharan (1993) “Tactically Delayed Scheduling in a Dynamic Single Machine Shop”, Working Paper, Clemson University.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media New York
About this chapter
Cite this chapter
Morton, T.E., Ramnath, P. (1995). Guided Forward Search in Tardiness Scheduling of Large One Machine Problems. In: Brown, D.E., Scherer, W.T. (eds) Intelligent Scheduling Systems. Operations Research / Computer Science Interfaces Series, vol 3. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2263-8_4
Download citation
DOI: https://doi.org/10.1007/978-1-4615-2263-8_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5954-8
Online ISBN: 978-1-4615-2263-8
eBook Packages: Springer Book Archive