|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 22 van 27 gevonden artikelen
| Titel: |
Production scheduling of single-stage multi-product batch chemical processes with fixed batch sizes |
| Auteur: |
Dessouky, Maged M. Kijowski, Brian A. |
| Verschenen in: |
IIE transactions |
| Paginering: | Jaargang 29 (1997) nr. 5 pagina's 399-408 |
| Jaar: |
1997-05-01 |
| Inhoud: |
We address the problem of scheduling a single-stage multi-product batch chemical process with fixed batch sizes. We present a mixed-integer nonlinear programming model to determine the schedule of batches, the batch size, and the number of overtime shifts that satisfy the demand at minimum cost for this process. We introduce a polynomial-time algorithm to solve the problem when the processing times of all batches are identical and the setup and cleaning times are sequence-independent. The solution procedure is based on recognizing that the optimal fixed batch size is a member of a set whose cardinality is polynomial. Given a batch size, the problem may be formulated as an assignment problem. Thus, an optimal solution may be found by iteratively solving a polynomial number of assignment problems. This work was motivated by a pesticide manufacturing company in the design of a new plant where the assumptions of a single bottleneck machine, fixed batch sizes, sequence-independent setup times, and identical batch processing times are all valid. An example is developed for this application. |
| Uitgever: |
Taylor & Francis |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 22 van 27 gevonden artikelen
| << vorige | volgende >> |