Detailed scheduling of batch production in a cell with parallel facilities and common renewable resources

Hindi, Khalil S.; Toczyłowski, Eugeniusz

doi:10.1016/0360-8352(95)00008-o

Cited by 7 publications

(7 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This system is a modification of the powder detergent plant considered by Hindi and Toczylowski. 2 We solved example II with R ) β ) 1, DT U ) 21 h (eq 12), and K ) 3-5. Table 6 gives the computational results and the best objective values.…”

Section: Model Analysis and Simplificationmentioning

confidence: 99%

Scheduling Parallel Production Lines with Resource Constraints. 2. Decomposition Algorithm

Lamba

Karimi

2002

Ind. Eng. Chem. Res.

View full text Add to dashboard Cite

In the preceding paper, we presented a mixed-integer linear programming model (MILP) for scheduling operation in a multiproduct facility comprising multiple parallel semicontinuous production lines. In this part, we first perform a critical analysis of the model structure and its various constraints and the various solver options. Because, even after that effort, the model remains computationally expensive for large-scale industrial applications, we use it to develop an efficient two-step decomposition algorithm. The main idea behind this algorithm is to first generate several good, feasible item combinations by repeatedly solving the model with a minimum number of slots and then to compose a schedule using these item combinations. A computationally easier new model for sequencing and scheduling item combinations is derived from the original model. When applied to an industrial problem from a detergent plant, the new algorithm gives near-optimal solutions in far less time than the original model.

show abstract

Section: Model Analysis and Simplificationmentioning

confidence: 99%

Scheduling Parallel Production Lines with Resource Constraints. 2. Decomposition Algorithm

Lamba

Karimi

2002

Ind. Eng. Chem. Res.

View full text Add to dashboard Cite

show abstract

“…A column generation technique combined with a genetic algorithm was applied in (Figielska, 1998(Figielska, , 1999 to solving resource-constrained problems with setup times and costs. In (Hindi & Toczyłowski, 1995), a searching procedure combined with tabu search technique was used for solving a resource constrained scheduling problem with setup times. In (Figielska, 2006) a genetic algorithm was developed for a problem in which non-preemptive jobs as well as setups use some amounts of additional renewable resources.…”

Section: Introductionmentioning

confidence: 99%

A new heuristic for scheduling the two-stage flowshop with additional resources

Figielska

2008

Computers & Industrial Engineering

View full text Add to dashboard Cite

“…Hindi and Toczylowski 12 addressed the scheduling of production in a cell consisting of several parallel facilities with structural as well as resource constraints and product family transitions. This is very similar to the one addressed in this two-part series.…”

Section: Introductionmentioning

confidence: 99%

Scheduling Parallel Production Lines with Resource Constraints. 1. Model Formulation

Lamba

Karimi

2002

Ind. Eng. Chem. Res.

View full text Add to dashboard Cite

Parallel semicontinuous production lines producing multiple items are quite common in many multiproduct chemical plants. The operation of such lines may be constrained by the structure and capacity of upstream and/or downstream material handling facilities and the availability of common resources. In addition, sequence-dependent transitions may be required. In this two-part paper, we address the short-term scheduling of such plants with a composite objective of minimizing transitions and maximizing productivity. In this part, we present a novel mixed-integer linear programming (MILP) formulation employing a single set of nonuniform time slots for all lines. The formulation improves upon a previous treatment of minimum campaign lengths and proposes new continuous resource constraints that are derived from binary ones. Application of the model to an illustrative example suggests that the solution time increases exponentially with the number of time slots and that adding transition time to the makespan improves both model performance and schedule quality. Although suitable only for small problems in its present form, the model forms the backbone of a more efficient decomposition algorithm presented in the second part.

show abstract

Detailed scheduling of batch production in a cell with parallel facilities and common renewable resources

Cited by 7 publications

References 19 publications

Scheduling Parallel Production Lines with Resource Constraints. 2. Decomposition Algorithm

Scheduling Parallel Production Lines with Resource Constraints. 2. Decomposition Algorithm

A new heuristic for scheduling the two-stage flowshop with additional resources

Scheduling Parallel Production Lines with Resource Constraints. 1. Model Formulation

Contact Info

Product

Resources

About