Scheduling batches with simultaneous job processing for two-machine shop problems
Scheduling batches with simultaneous job processing for two-machine shop problems
We consider the problem of scheduling independent jobs on two machines in an open shop, a job shop and a flow shop environment. Both machines are batching machines, which means that several operations can be combined into a batch and processed simultaneously on a machine. The batch processing time is the maximum processing time of operations in the batch, and all operations in a batch complete at the same time. Such a situation may occur, for instance, during the final testing stage of circuit board manufacturing, where burn-in operations are performed in ovens. We consider cases in which there is no restriction on the size of a batch on a machine, and in which a machine can process only a bounded number of operations in one batch. For most of the possible combinations of restrictions, we establish the complexity status of the problem.
scheduling, batching, polynomial algorithm, NP-hard, open shop, job shop, flow shop
25-51
Potts, C.N.
58c36fe5-3bcb-4320-a018-509844d4ccff
Strusevich, V.A.
c3492f02-0366-4bf0-8754-530231572039
Tautenhahn, T.
e2e84611-96f5-4887-82b1-0cfd195ac986
2001
Potts, C.N.
58c36fe5-3bcb-4320-a018-509844d4ccff
Strusevich, V.A.
c3492f02-0366-4bf0-8754-530231572039
Tautenhahn, T.
e2e84611-96f5-4887-82b1-0cfd195ac986
Abstract
We consider the problem of scheduling independent jobs on two machines in an open shop, a job shop and a flow shop environment. Both machines are batching machines, which means that several operations can be combined into a batch and processed simultaneously on a machine. The batch processing time is the maximum processing time of operations in the batch, and all operations in a batch complete at the same time. Such a situation may occur, for instance, during the final testing stage of circuit board manufacturing, where burn-in operations are performed in ovens. We consider cases in which there is no restriction on the size of a batch on a machine, and in which a machine can process only a bounded number of operations in one batch. For most of the possible combinations of restrictions, we establish the complexity status of the problem.
This record has no associated files available for download.
More information
Published date: 2001
Keywords:
scheduling, batching, polynomial algorithm, NP-hard, open shop, job shop, flow shop
Organisations:
Operational Research
Identifiers
Local EPrints ID: 29616
URI: http://eprints.soton.ac.uk/id/eprint/29616
PURE UUID: 7ab55ce7-5aaa-4b45-bace-24171755a19e
Catalogue record
Date deposited: 12 May 2006
Last modified: 15 Mar 2024 07:33
Export record
Altmetrics
Contributors
Author:
V.A. Strusevich
Author:
T. Tautenhahn
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics