LOT STREAMING IN A 2-STAGE FLOW-SHOP WITH SET-UP, PROCESSING AND REMOVAL TIMES SEPARATED

Date

1994-12-01

Author

CETINKAYA, FC

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

184
views

0
downloads

This paper considers the job (lot) scheduling problem for two-stage flow shops in which the movement of transfer batches (sublots) from the first stage to the next are allowed. Set-up, processing and removal times are considered as separable and independent of the order in which jobs are processed at any of two stages. An optimal transfer batch sizing and scheduling algorithm which has an objective of minimizing the maximum flow time (makespan) is developed and demonstrated by a numerical example.

Subject Keywords

Marketing, Management Science and Operations Research, Strategy and Management, Management Information Systems

URI

https://hdl.handle.net/11511/63838

Journal

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY

DOI

https://doi.org/10.1057/jors.1994.221

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

JOB-SHOP SCHEDULING UNDER A NONRENEWABLE RESOURCE CONSTRAINT TOKER, A; KONDAKCI, S; ERKIP, N (JSTOR, 1994-08-01) In this paper we consider the job shop scheduling problem under a discrete non-renewable resource constraint. We assume that jobs have arbitrary processing times and resource requirements and there is a unit supply of the resource at each time period. We develop an approximation algorithm for this problem and empirically test its effectiveness in finding the minimum makespan schedules.
Rescheduling unrelated parallel machines with total flow time and total disruption cost criteria Ozlen, M.; Azizoğlu, Meral (Informa UK Limited, 2011-01-01) In this paper, we consider a rescheduling problem where a set of jobs has already been assigned to unrelated parallel machines. When a disruption occurs on one of the machines, the affected jobs are rescheduled, considering the efficiency and the schedule deviation measures. The efficiency measure is the total flow time, and the schedule deviation measure is the total disruption cost caused by the differences between the initial and current schedules. We provide polynomial-time solution methods to the follo...
SCHEDULING UNDER A NONRENEWABLE RESOURCE CONSTRAINT TOKER, A; KONDAKCI, S; ERKIP, N (Informa UK Limited, 1991-09-01) This paper examines a single-machine, non-renewable-resource-constrained scheduling problem where jobs have arbitary processing times and resource requirements. Unit supply of a resource is assumed at each time period. Performance criterion is makespan. It is proved that this problem is identical to the two-machine flowshop problem, enabling the use of Johnson's algorithm. Immediate extensions of this result are presented.
Flexible assembly line design problem with fixed number of workstations Barutcuoglu, Sirin; Azizoğlu, Meral (Informa UK Limited, 2011-01-01) In the paper, we study a flexible assembly line design problem with equipment decisions. We assume the task times and equipment costs are correlated in the sense that for all tasks the cheaper equipment gives no smaller task time. Given the cycle time and number of workstations we aim to find the assignment of tasks and equipment to the workstations so as to minimise the total equipment cost. We develop a branch and bound algorithm that uses powerful lower bounds and reduction mechanisms. Our computational ...
AN ALGORITHM FOR THE COMMITTEE CONSTRUCTION PROBLEM CEYLAN, D; SAATCIOGLU, O; SEPIL, C (Elsevier BV, 1994-08-25) This paper presents an approach to the problem of committee construction for Associate Professorship promotions. In Turkey, the promotion to the 'Associate Professor' title is centrally organized by the Interuniversity Council. The Interuniversity Council assigns an evaluation committee to each applicant. Each applicant is then examined by the committee based on his/her publications and background. The problem is, how to form juries in order to maximize the match of background of the jury members and the ca...

Citation Formats

F. CETINKAYA, “LOT STREAMING IN A 2-STAGE FLOW-SHOP WITH SET-UP, PROCESSING AND REMOVAL TIMES SEPARATED,” JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, pp. 1445–1455, 1994, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/63838.