Lotsizing and scheduling on parallel machines with sequence-dependent setup costs
Article Abstract:
An unconventional model was developed to address a multiperiod production lotsizing and scheduling problem that involves allocation and sequencing of blocked productions with sequence-based setup costs on parallel machines. This analysis is aimed at finding a solution for the CHES Problems, a set of problem instances from Chesapeake Decision Sciences Inc that requires determining a production schedule that ensures that costs are controlled, product demand is met and production on each machine does not surpass capacity. In this model, a sequence of products developed on a machine throughout the planning horizon is treated as a collection of subsequences. The entire schedule is split into subsequences, which generate manageable subproblems. An optimization approach that uses a column generation/branch and bound methodology was heuristically employed to test problems.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1999
User Contributions:
Comment about this article or add new information about this topic:
A dual ascent and column generation heuristic for the discrete lotsizing andscheduling problem with setup times
Article Abstract:
A heurisitic for the solution of the Discrete Lotsizing and Scheduling Problem (DLSP) is developed and evaluated. DLSP involves finding a minimal cost production schedule that ensures demand fulfillment without backlogging. Such a schedule includes production batch sequencing and sizing for multiple units on a single machine. A dual ascent and column generation heuristic is proposed for the solution of the DLSP, which is reformulated into a set partitioning problem. Eighty-two percent of the 420 test problems were given optimal solutions through this method, with medium-sized problems requiring five minutes solution time. Relative to other models, the proposed framework is successful given that DLSP lends itself to polynomial solution when multi-item capacity contraints are relaxed, and that the method generates tight lower bounds.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1993
User Contributions:
Comment about this article or add new information about this topic:
Some extensions of the discrete lotsizing and scheduling problem
Article Abstract:
The Discrete Lotsizing and Scheduling Problem (DLSP) relates to production difficulties including sequencing and sizing of production lots, job scheduling, and cost control that arise in a single-stage manufacturing process. The DLSP model was compared with other lotsizing formulations such as the Continuous Setup Lotsizing Problem (CSLP), the Capacitated Lotsizing Problem (CLSP), the Economic Lotsizing and Scheduling Problem (ELSP), and to different Job Scheduling Problems (JSP). The DLSP may be preferable over the other models because it combines lotsizing and job sequencing, and it also offers computational advantages.
Publication Name: Management Science
Subject: Business, general
ISSN: 0025-1909
Year: 1991
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: 1995 spending cuts signed by Clinton. Balanced-budget amendment blocked by Senate Democrats. Clinton budget plan clears Congress; $496 billion in tax hikes and spending cuts set
- Abstracts: Olivetti obtains pact to shed PC unit; Centenary, led by American, creates firm to acquire loss-ridden operations
- Abstracts: Exploring start-up event sequences. Complexity dynamics of nascent entrepreneurship. Words lead to deeds: towards an organizational emergence vocabulary
- Abstracts: Team playing is on the rise. If I only knew then what I know now. Daughters as successors in 'male' industries
- Abstracts: Microsoft sets a new strategy for investments. Amazon buys stake in upstart Drugstore.com