Decision Support and Optimization in Shutdown and Turnaround Scheduling

References

• Adel S. M., Elmaghraby S. E. Optimal linear approximation in project compression. IIE Trans. (1984) 16(4):339–347Crossref, Google Scholar
• Adlakha V. G., Kulkarni V. G. A classified bibliography of research on stochastic PERT networks: 1966–1987. Inform. Systems Oper. Res. (1989) 27(3):272–296Crossref, Google Scholar
• Bandelloni M., Tucci M., Rinaldi R. Optimal resource leveling using non-serial dynamic programming. J. Soc. Indust. Appl. Math. (1994) 78(2):162–177Google Scholar
• Bourges A., Killebrew J. Variation in activity level in a cyclical arrow diagram. J. Indust. Engrg. (1962) 13(2):76–83Google Scholar
• Brucker P., Drexl A., Möhring R., Neumann K., Pesch E. Resource-constrained project scheduling: Notation, classification, models, and methods. Eur. J. Oper. Res. (1999) 112(1):3–41Crossref, Google Scholar
• Cieliebak M., Erlebach T., Hennecke F., Weber B., Widmayer P., Lévy J.-J., Mayr E. W., Mitchell J. C. Scheduling with release times and deadlines on a minimum number of machines. Exploring New Frontiers of Theoretical Informatics: IFIP 18th World Comput. Congress. Proc. Third IFIP Internat. Conf. Theoret. Comput. Sci. (TCS 2004) (2004) Norwell, MA(Kluwer Academic Publishers)209–222Crossref, Google Scholar
• De P., Dunne E. J., Ghosh J. B., Wells C. E. The discrete time-cost tradeoff problem revisited. Eur. J. Oper. Res. (1995) 81(2):225–238Crossref, Google Scholar
• De P., Dunne E. J., Ghosh J. B., Wells C. E. Complexity of the discrete time-cost tradeoff problem for project networks. Oper. Res. (1997) 45(2):302–306Link, Google Scholar
• Deineko V. G., Woeginger G. J. Hardness of approximation of the discrete time-cost tradeoff problem. Oper. Res. Lett. (2001) 29(5):207–210Crossref, Google Scholar
• Demeulemeester E. L., Herroelen W. S.Project Scheduling: A Research Handbook (2002) (Kluwer Academic Publishers, Norwell, MA) Google Scholar
• Du J., Leung J. Y.-T. Complexity of scheduling parallel task systems. SIAM J. Discrete Math. (1989) 2(4):473–487Crossref, Google Scholar
• Easa S. M. Resource leveling in construction by optimization. J. Construction Engrg. Management (1989) 115(2):302–316Crossref, Google Scholar
• Elmaghraby S. E., Kamburowski J. The analysis of activity networks under generalized precedence relations (GPRs). Management Sci. (1992) 38(9):1245–1263Link, Google Scholar
• Falk J. E., Horowitz J. L. Critical path problems with concave cost-time curves. Management Sci. (1972) 19(4, Part 1):446–455Link, Google Scholar
• Franck B., Neumann K., Schwindt C. Project scheduling with calendars. OR Spectrum (2001) 23(3):325–334Crossref, Google Scholar
• Fulkerson D. R. A network flow computation for project cost curves. Management Sci. (1961) 7(2):167–178Link, Google Scholar
• Grigoriev A., Sviridenko M., Uetz M. Machine scheduling with resource dependent processing times. Math. Programming (2007) 110(1):209–228Crossref, Google Scholar
• Hagstrom J. N. Computational complexity of PERT problems. Networks (1988) 18(2):139–147Crossref, Google Scholar
• Harris R. B. Packing method for resource leveling (PACK). J. Construction Engrg. Management (1990) 116(2):331–350Crossref, Google Scholar
• Jansen K., Zhang H. An approximation algorithm for scheduling malleable tasks under general precedence constraints. ACM Trans. Algorithms (2006) 2(3):416–434Crossref, Google Scholar
• Kapur K. C. An algorithm for the project cost-duration analysis problem with quadratic and convex cost functions. IIE Trans. (1973) 5(4):314–332Google Scholar
• Kelley J. E. Critical-path planning and scheduling: Mathematical basis. Oper. Res. (1961) 9(3):296–320Link, Google Scholar
• Lamberson L. R., Hocking R. R. Optimum time compression in project scheduling. Management Sci. (1970) 16(10):B597–B606Link, Google Scholar
• Lepère R., Trystram D., Woeginger G. J. Approximation algorithms for scheduling malleable tasks under precedence constraints. Internat. J. Found. Comput. Sci. (2002) 13(4):613–627Crossref, Google Scholar
• Ludwig A., Möhring R. H., Stork F. A computational study on bounding the makespan distribution in stochastic project networks. Ann. Oper. Res. (2001) 102(1–4):49–64Crossref, Google Scholar
• Meilijson I., Nádas A. Convex majorization with an application to the length of critical paths. J. Appl. Probab. (1979) 16(3):671–677Crossref, Google Scholar
• Möhring R. H., Alt H. Scheduling under uncertainty: Bounding the makespan distribution. Comput. Discrete Math. Lecture Notes in Computer Science (2001) 2122(Springer, Berlin) 79–97Crossref, Google Scholar
• Neumann K., Zimmermann J. Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints. Eur. J. Oper. Res. (2000) 127(2):425–443Crossref, Google Scholar
• Neumann K., Schwindt C., Zimmermann J.Project Scheduling with Time Windows and Scarce Resources (2003) 2nd ed(Springer, Berlin) Crossref, Google Scholar
• Phillips D. T., Garcia-Diaz A.Fundamentals of Network Analysis (1981) (Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• Phillips S., Dessouky M. I. Solving the project time/cost tradeoff problem using the minimal cut concept. Management Sci. (1977) 24(4):393–400Link, Google Scholar
• Pritsker A. A. B., Watters L. J., Wolfe P. M. Multiproject scheduling with limited resources: A zero-one programming approach. Management Sci. (1969) 16(1):93–108Link, Google Scholar
• Schmidt G. Scheduling with limited machine availability. Eur. J. Oper. Res. (2000) 121(1):1–15Crossref, Google Scholar
• Shabtay D., Steiner G. A survey of scheduling with controllable processing times. Discrete Appl. Math. (2007) 155(13):1643–1666Crossref, Google Scholar
• Siemens N., Gooding C. Reducing project duration at minimum cost: A time-cost tradeoff algorithm. OMEGA (1975) 3(5):569–581Crossref, Google Scholar
• Skutella M. Approximation algorithms for the discrete time-cost tradeoff problem. Math. Oper. Res. (1998a) 23(4):909–929Link, Google Scholar
• Skutella M. Approximation and randomization in scheduling. (1998b) . Ph.D. thesis, Technische Universität Berlin, BerlinGoogle Scholar
• Vanhoucke M. New computational results for the discrete time/cost trade-off problem with time-switch constraints. Eur. J. Oper. Res. (2005) 165(2):359–374Crossref, Google Scholar
• Vanhoucke M., Debels D. The discrete time/cost trade-off problem: Extensions and heuristic procedures. J. Sched. (2007) 10(4–5):311–326Crossref, Google Scholar
• Vanhoucke M., Demeulemeester E., Herroelen W. Discrete time/cost trade-offs in project scheduling with time-switch constraints. J. Oper. Res. Soc. (2002) 53(7):1–11Crossref, Google Scholar
• Weiss G. Stochastic bounds on distributions of optimal value functions with applications to PERT, network flows and reliability. Oper. Res. (1986) 34(4):595–605Link, Google Scholar
• Yang H.-H., Chen Y.-L. Finding the critical path in an activity network with time-switch constraints. Eur. J. Oper. Res. (2000) 120(3):603–613Crossref, Google Scholar
• Zhan J. Calendarization of time planning in MPM networks. ZOR—Methods Models Oper. Res. (1992) 36(5):423–438Crossref, Google Scholar