# Scheduling batches with simultaneous job processing for two-machine shop problems

Potts, C.N., Strusevich, V.A. and Tautenhahn, T.
(2001)
*Scheduling batches with simultaneous job processing for two-machine shop problems.*
Journal of Scheduling, 4 (1).
pp. 25-51.
ISSN 1094-6136 (Print), 1099-1425 (Online)
(doi:10.1002/1099-1425(200101/02)4:1<25::AID-JOS58>3.0.CO;2-7)

## 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.

Item Type: | Article |
---|---|

Uncontrolled Keywords: | scheduling, batching, polynomial algorithm, NP-hard, open shop, job shop, flow shop |

Subjects: | Q Science > QA Mathematics > QA76 Computer software T Technology > TJ Mechanical engineering and machinery |

Pre-2014 Departments: | School of Computing & Mathematical Sciences School of Computing & Mathematical Sciences > Department of Mathematical Sciences School of Computing & Mathematical Sciences > Statistics & Operational Research Group |

Related URLs: | |

Last Modified: | 14 Oct 2016 09:01 |

URI: | http://gala.gre.ac.uk/id/eprint/581 |

### Actions (login required)

View Item |