Two-machine flowshop scheduling with flexible operations and controllable processing times

Authors:
Zeynep Uruk;Hakan Gultekin;M. Selim Akturk
Affiliations:
Department of Industrial Engineering, Bilkent University, 06800 Ankara, Turkey;Department of Industrial Engineering, TOBB University of Economics and Technology, 06560 Ankara, Turkey;Department of Industrial Engineering, Bilkent University, 06800 Ankara, Turkey
Venue:
Computers and Operations Research
Year:
2013

Citing 6
Cited 0

Multicriteria Scheduling: Theory, Models and Algorithms

Multicriteria Scheduling: Theory, Models and Algorithms
A survey of scheduling with controllable processing times

Discrete Applied Mathematics
Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility

Computers and Operations Research
Bicriteria robotic operation allocation in a flexible manufacturing cell

Computers and Operations Research
Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling

Discrete Applied Mathematics
Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider a two-machine flowshop scheduling problem with identical jobs. Each of these jobs has three operations, where the first operation must be performed on the first machine, the second operation must be performed on the second machine, and the third operation (named as flexible operation) can be performed on either machine but cannot be preempted. Highly flexible CNC machines are capable of performing different operations. Furthermore, the processing times on these machines can be changed easily in albeit of higher manufacturing cost by adjusting the machining parameters like the speed and/or feed rate of the machine. The overall problem is to determine the assignment of the flexible operations to the machines and processing times for each operation to minimize the total manufacturing cost and makespan simultaneously. For such a bicriteria problem, there is no unique optimum but a set of nondominated solutions. Using @e-constraint approach, the problem could be transformed to be minimizing total manufacturing cost for a given upper limit on the makespan. The resulting single criterion problem can be reformulated as a mixed integer nonlinear problem with a set of linear constraints. We use this formulation to optimally solve small instances of the problem while a heuristic procedure is constructed to solve larger instances in a reasonable time.