Rescheduling with controllable processing times for number of disrupted jobs and manufacturing cost objectives

Date

2015-05-03

Author

Gürel, Sinan

Metadata

Show full item record

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

Item Usage Stats

178
views

0
downloads

We consider a machine rescheduling problem that arises when a disruption such as machine breakdown occurs to a given schedule. Machine unavailability due to a breakdown requires repairing the schedule as the original schedule becomes infeasible. When repairing a disrupted schedule a desirable goal is to complete each disrupted job on time, i.e. not later than the planned completion time in the original schedule. We consider the case where processing times of jobs are controllable and compressing the processing time of a job requires extra processing cost. Usually, there exists a nonlinear relation between the processing time and manufacturing cost. We solve a bicriteria rescheduling problem that trades off the number of on-time jobs and manufacturing cost objectives. We give a mixed-integer second-order cone programming formulation for the problem. We develop a heuristic search algorithm to generate efficient solutions for the problem. Heuristic algorithm searches solution space by moving and swapping jobs among machines. We develop cost change estimates for job moves and swaps so that the heuristic implements only promising moves and hence generates a set of efficient solutions in reasonably short CPU times.

Subject Keywords

Neighbourhood search, Manufacturing cost, Second-order cone programming, Controllable processing times, Rescheduling

URI

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

Journal

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH

DOI

https://doi.org/10.1080/00207543.2014.980452

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

Rescheduling of identical parallel machines under machine eligibility constraints Alagoz, O; Azizoğlu, Meral (2003-09-16) In this study, we address a rescheduling problem in parallel machine environments under machine eligibility constraints. We consider total flow time as efficiency measure and the number of jobs processed on different machines in the initial and revised schedules as a stability measure. We present an optimizing algorithm for minimizing the stability measure subject to the constraint that the efficiency measure is at its minimum level. We then propose several heuristic procedures to generate a set of approxim...
Scheduling about an unrestricted common due window with arbitrary earliness/tardiness penalty rates Azizoğlu, Meral (Informa UK Limited, 1997-11-01) We consider the NP-hard problem of scheduling jobs on a single machine about an unrestricted due window to minimize total weighted earliness and tardiness cost. Each job has an earliness penalty rate and a tardiness penalty rate that are allowed to be arbitrary. Earliness or tardiness cost is assessed when a job completes outside the due window, which may be an instant in time or a time increment defining acceptable job completion. In this paper we present properties that characterize the structure of an op...
Energy conscious scheduling in a two-machine robotic cell Akhlaghi, Vahid Eghbal; Gürel, Sinan; Gültekin, Hakan; Department of Industrial Engineering (2017) Robotic cells usually operate under time pressure to minimize time related objectives such as cycle time, makespan, and tardiness. Robot moves constitute a significant portion of cycle time. Also, robots consume significant amount of energy determined by the speeds and distances of their moves. We study the tradeoff between the cycle time and energy consumption of a robot in a two machine flexible robotic cell which processes identical parts. In this system, the loading and unloading of machines are made by...
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...
Preemptive scheduling on identical parallel machines subject to deadlines Azizoğlu, Meral (2003-07-01) We consider the problem of scheduling n preemptive jobs with deadlines on in identical parallel machines so as to minimize total completion time. We show that the problem is polynomially solvable when the processing times and deadlines are agreeable.

Citation Formats

S. Gürel, “Rescheduling with controllable processing times for number of disrupted jobs and manufacturing cost objectives,” INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, pp. 2751–2770, 2015, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/48499.