Melt Scheduling to Trade Off Material Waste and Shipping Performance

References

  • Bagchi Uttarayan, Julien François M., Magazine Michael J. Due-date assignment to multi-job customer orders. Management Sci. (1994) 40:1389–1392LinkGoogle Scholar
  • Baker Kenneth R. Sequencing rules and due-date assignments in a job shop. Management Sci. (1984) 30:1093–1104LinkGoogle Scholar
  • Bookbinder James H., H'ng Bak-Tee. Production lot sizing for deterministic rolling schedules. J. Oper. Management (1986) 6:349–362CrossrefGoogle Scholar
  • Chand Suresh. Rolling horizon procedures for the facilities in series inventory model with nested schedules. Management Sci. (1983) 29:237–249LinkGoogle Scholar
  • Chand Suresh, Traub Rodney, Uzsoy Reha. Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates. Ann. Oper. Res. (1997) 70:115–125CrossrefGoogle Scholar
  • Cheng T. C. E. Optimal due-date assignment in an assembly shop. Internat. J. Oper. & Production Management (1994) 14:31–42CrossrefGoogle Scholar
  • Cheng T. C. E., Gupta M. C. Survey of scheduling research involving due date determination decisions. Eur. J. Oper. Res. (1989) 38:156–166CrossrefGoogle Scholar
  • De Prabuddha, Ghosh Jay B., Wells Charles E. Due-date assignment and early/tardy scheduling on identical parallel machines. Naval Res. Logis. (1994) 41:17–32CrossrefGoogle Scholar
  • Dellaert Nico P. Due-date setting and production control. Internat. J. Production Econom. (1991) 23:59–67CrossrefGoogle Scholar
  • Dorn Jürgen, Slany W., Zweben M., Fox M. A flow shop with compatibility constraints in a steelmaking plant. Intelligent Scheduling (1994) (Morgan Kaufmann, San Francisco, CA) Google Scholar
  • Duenyas Izak. Single facility due date setting with multiple customer classes. Management Sci. (1995) 41:608–619LinkGoogle Scholar
  • Luss Hanan, Rosenwein Moshe B. A due date assignment algorithm for multiproduct manufacturing facilities. Eur. J. Oper. Res. (1993) 65:187–198CrossrefGoogle Scholar
  • Minton S., Johnston M., Philips A., Laird P. Solving large-scale constraint satisfaction and scheduling problems using a heuristic repair method. Proc. 8th National Conference on Artificial Intelligence (1989) (AAAI Press, Menlo Park, CA) Google Scholar
  • Numao M., Morishita S. A scheduling environment for steel-making processes. Proc. 5th International Conference on Artificial Intelligence for Industrial Applications (1989) (IEEE Computer Society Press, Los Alamitos, CA) CrossrefGoogle Scholar
  • Ovacik I. M., Uzsoy R. Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times. Internat. J. Production Res. (1995) 33:3173–3192CrossrefGoogle Scholar
  • Ozdamar Linet, Yazgac Tulin. Capacity driven due date setting in make-to-order production systems. Internat. J. Production Econom. (1997) 49:29–44CrossrefGoogle Scholar
  • Russell R. A., Urban T. L. Horizon extension for rolling production schedules: Length and accuracy requirements. Internat. J. Production Econom. (1993) 29:111–122CrossrefGoogle Scholar
  • Seidmann Abraham, Smith Milton L. Due date assignment for production systems. Management Sci. (1981) 27:571–581LinkGoogle Scholar
  • Sethi S., Sorger G. A theory of rolling horizon decision making. Ann. Oper. Res. (1991) 29:387–416CrossrefGoogle Scholar
  • Stauffer L., Liebling Th. M. Rolling horizon scheduling in a rolling-mill. Ann. Oper. Res. (1997) 69:323–349CrossrefGoogle Scholar
  • Storer R. H., Wu S. D., Vaccari. Local search in problem and heuristic space for job shop scheduling. ORSA J. Compu. (1996) 8Google Scholar
  • Storer R. H., Wu S. D., Vaccari. New search spaces for sequencing problems with application to job shop scheduling. Management Sci. (1992) 38:1495–1509LinkGoogle Scholar
  • Udo G. An investigation of due-date assignment using workload information of a dynamic shop. Internat. J. Production Econom. (1993) 29:89–101CrossrefGoogle Scholar
  • Uzsoy R., Ovacik I. M. Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times. Internat. J. Production Res. (1994) 32:1243–1263CrossrefGoogle Scholar
  • Venkataraman R., Smith S. B. Disaggregation to a rolling horizon master production schedule with minimum batch-size production restrictions. Internat. J. Production Res. (1996) 34:1517–1537CrossrefGoogle Scholar
  • Vig Michelle M., Dooley Kelvin J. Dynamic rules for due date assignment. IJPR (1991) 29:1361–1377CrossrefGoogle Scholar
  • Wein Lawrence M. Due-date setting and priority sequencing in a multiclass M/G/1 queue. Management Sci. (1991) 37:834–850LinkGoogle Scholar
  • Wu S. David, Byeon E.-S., Storer Robert H. A graph-theoretic decomposition of job shop scheduling problem to achieve schedulign robustness. Oper. Res. (1999) 47(1):113–124LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.