Solving a chemical batch scheduling problem by local search

DC FieldValueLanguage
dc.contributor.authorBrucker, P
dc.contributor.authorHurink, J
dc.date.accessioned2021-12-23T16:09:13Z-
dc.date.available2021-12-23T16:09:13Z-
dc.date.issued2000
dc.identifier.issn02545330
dc.identifier.urihttps://osnascholar.ub.uni-osnabrueck.de/handle/unios/8676-
dc.description2nd ALIO/EURO Workshop on Practical Combinatorial Optimization, VALPARAISO, CHILE, 1996
dc.description.abstractIn this paper the following chemical batch scheduling problem is considered: a set of orders has to be processed on a set of facilities. For each order a given amount of a product must be produced by means of chemical reactions before a given deadline. The production consists of a sequence of processes whereby each process has to be performed by one facility out of a given subset of facilities allowed for this process. The processing times depend on the choice of the facility and the processing is done in batch mode with given minimum and maximum sizes. The problem is to assign the processes to the facilities, splitting them into batches, and scheduling these batches in order to produce the demands within the given deadlines. For the scheduling part of the problem we present an approach based on the following steps. First, a procedure to calculate the minimum number of batches needed to satisfy the demands is presented. Based on this,the given problem is modeled in two different ways: as a general shop scheduling problem with set-up times or as scheduling problem with positive time-lags. Finally, a two-phase tabu search method is presented which is based on the two different formulations of the problem. The method is tested on some real world data.
dc.language.isoen
dc.publisherSPRINGER
dc.relation.ispartofANNALS OF OPERATIONS RESEARCH
dc.subjectbatch production
dc.subjectcase study
dc.subjectgeneral shop problem
dc.subjectmixed graph scheduling
dc.subjectOperations Research & Management Science
dc.subjecttabu search
dc.subjecttime-lags
dc.titleSolving a chemical batch scheduling problem by local search
dc.typeconference paper
dc.identifier.doi10.1023/A:1018959704264
dc.identifier.isiISI:000165797300003
dc.description.volume96
dc.description.startpage17
dc.description.endpage38
dc.contributor.orcid0000-0001-6986-5633
dc.contributor.researcheridI-4491-2019
dc.identifier.eissn15729338
dc.publisher.placeVAN GODEWIJCKSTRAAT 30, 3311 GZ DORDRECHT, NETHERLANDS
dcterms.isPartOf.abbreviationAnn. Oper. Res.
dcterms.oaStatusGreen Submitted
Show simple item record

Page view(s)

1
Last Week
0
Last month
0
checked on Apr 19, 2024

Google ScholarTM

Check

Altmetric