Melt Scheduling to Trade Off Material Waste and Shipping Performance
Published Online:1 Oct 2001https://doi.org/10.1287/opre.49.5.629.10611
References
- Due-date assignment to multi-job customer orders. Management Sci. (1994) 40:1389–1392Link, Google Scholar
- Sequencing rules and due-date assignments in a job shop. Management Sci. (1984) 30:1093–1104Link, Google Scholar
- . Production lot sizing for deterministic rolling schedules. J. Oper. Management (1986) 6:349–362Crossref, Google Scholar
- . Rolling horizon procedures for the facilities in series inventory model with nested schedules. Management Sci. (1983) 29:237–249Link, Google Scholar
- . Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates. Ann. Oper. Res. (1997) 70:115–125Crossref, Google Scholar
- Optimal due-date assignment in an assembly shop. Internat. J. Oper. & Production Management (1994) 14:31–42Crossref, Google Scholar
- Survey of scheduling research involving due date determination decisions. Eur. J. Oper. Res. (1989) 38:156–166Crossref, Google Scholar
- Due-date assignment and early/tardy scheduling on identical parallel machines. Naval Res. Logis. (1994) 41:17–32Crossref, Google Scholar
- Due-date setting and production control. Internat. J. Production Econom. (1991) 23:59–67Crossref, Google Scholar
- , Zweben M., Fox M. A flow shop with compatibility constraints in a steelmaking plant. Intelligent Scheduling (1994) (Morgan Kaufmann, San Francisco, CA) Google Scholar
- . Single facility due date setting with multiple customer classes. Management Sci. (1995) 41:608–619Link, Google Scholar
- A due date assignment algorithm for multiproduct manufacturing facilities. Eur. J. Oper. Res. (1993) 65:187–198Crossref, Google Scholar
- 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
- 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) Crossref, Google Scholar
- Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times. Internat. J. Production Res. (1995) 33:3173–3192Crossref, Google Scholar
- . Capacity driven due date setting in make-to-order production systems. Internat. J. Production Econom. (1997) 49:29–44Crossref, Google Scholar
- Horizon extension for rolling production schedules: Length and accuracy requirements. Internat. J. Production Econom. (1993) 29:111–122Crossref, Google Scholar
- Due date assignment for production systems. Management Sci. (1981) 27:571–581Link, Google Scholar
- A theory of rolling horizon decision making. Ann. Oper. Res. (1991) 29:387–416Crossref, Google Scholar
- Rolling horizon scheduling in a rolling-mill. Ann. Oper. Res. (1997) 69:323–349Crossref, Google Scholar
- . Local search in problem and heuristic space for job shop scheduling. ORSA J. Compu. (1996) 8Google Scholar
- . New search spaces for sequencing problems with application to job shop scheduling. Management Sci. (1992) 38:1495–1509Link, Google Scholar
- An investigation of due-date assignment using workload information of a dynamic shop. Internat. J. Production Econom. (1993) 29:89–101Crossref, Google Scholar
- Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times. Internat. J. Production Res. (1994) 32:1243–1263Crossref, Google Scholar
- Disaggregation to a rolling horizon master production schedule with minimum batch-size production restrictions. Internat. J. Production Res. (1996) 34:1517–1537Crossref, Google Scholar
- Dynamic rules for due date assignment. IJPR (1991) 29:1361–1377Crossref, Google Scholar
- Due-date setting and priority sequencing in a multiclass M/G/1 queue. Management Sci. (1991) 37:834–850Link, Google Scholar
- A graph-theoretic decomposition of job shop scheduling problem to achieve schedulign robustness. Oper. Res. (1999) 47(1):113–124Link, Google Scholar

