Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
An anticipative scheduling approach with controllable processing times
Download
index.pdf
Date
2010-06-01
Author
Gürel, Sinan
Akturk, M. Selim
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
137
views
0
downloads
Cite This
In practice, machine schedules are usually subject to disruptions which have to be repaired by reactive scheduling decisions. The most popular predictive approach in project management and machine scheduling literature is to leave idle times (time buffers) in schedules in coping with disruptions, i.e. the resources will be under-utilized. Therefore, preparing initial schedules by considering possible disruption times along with rescheduling objectives is critical for the performance of rescheduling decisions. In this paper, we show that if the processing times are controllable then an anticipative approach can be used to form an initial schedule so that the limited capacity of the production resources are utilized more effectively. To illustrate the anticipative scheduling idea, we consider a non-identical parallel machining environment, where processing times can be controlled at a certain compression cost. When there is a disruption during the execution of the initial schedule, a match-up time strategy is utilized such that a repaired schedule has to catch-up initial schedule at some point in future. This requires changing machine-job assignments and processing times for the rest of the schedule which implies increased manufacturing costs. We show that making anticipative job sequencing decisions, based on failure and repair time distributions and flexibility of jobs, one can repair schedules by incurring less manufacturing cost. Our computational results show that the match-up time strategy is very sensitive to initial schedule and the proposed anticipative scheduling algorithm can be very helpful to reduce rescheduling costs.
Subject Keywords
Management Science and Operations Research
,
Modelling and Simulation
,
General Computer Science
URI
https://hdl.handle.net/11511/40123
Journal
COMPUTERS & OPERATIONS RESEARCH
DOI
https://doi.org/10.1016/j.cor.2009.09.001
Collections
Department of Industrial Engineering, Article
Suggestions
OpenMETU
Core
Scheduling parallel CNC machines with time/cost trade-off considerations
Gürel, Sinan (Elsevier BV, 2007-09-01)
When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance. A well-known example for such a case that this paper specifically deals with is the turning operation on a CNC machine. Manufacturing cost of a turning operation is a nonlinear convex function of its processing time. We also know that scheduling decisions are quite sensitive to the processing times. Therefore, this paper considers minimizing total manufacturing cos...
Parallel machine match-up scheduling with manufacturing cost considerations
Akturk, M. Selim; Atamturk, Alper; Gürel, Sinan (Springer Science and Business Media LLC, 2010-02-01)
Many scheduling problems in practice involve rescheduling of disrupted schedules. In this study, we show that in contrast to fixed processing times, if we have the flexibility to control the processing times of the jobs, we can generate alternative reactive schedules considering the manufacturing cost implications in response to disruptions. We consider a non-identical parallel machining environment where processing times of the jobs are compressible at a certain manufacturing cost, which is a convex functi...
AN INTERACTIVE APPROACH FOR A DUAL CONSTRAINT JOB SHOP SCHEDULING PROBLEM
KONDAKCI, S; GUPTA, RM (Elsevier BV, 1991-01-01)
Until recently, heuristic dispatching rules were the only practical means to solve the job shop scheduling problem. Currently, a promising direction in job shop scheduling is interactive scheduling. In this study an interactive scheduling approach is developed for a dual-constraint dynamic job shop production environment. The approach is used by a number of subjects in an experiment. The performance of the subjects is compared with that of dispatching rules based on tardiness and other measures relevant...
A branch and price algorithm for the pharmacy duty scheduling problem
Ceyhan, Gokhan; ÖZPEYNİRCİ, NAİL ÖZGÜR (Elsevier BV, 2016-08-01)
Pharmacy Duty Scheduling (PDS) is the activity of assigning pharmacies to days during a planning horizon with the purpose of serving society outside regular working hours. In Turkey, pharmacies are retailers who operate during the working hours in weekdays. However, demand for medicine at nights, at the weekends and on holidays must be satisfied by allocating times to pharmacies to open at these times. The problem is a multi-period p-median problem with the additional problem specific constraints, and it is...
Optimal allocation and processing time decisions on non-identical parallel CNC machines: epsilon-constraint approach
Gürel, Sinan (Elsevier BV, 2007-12-01)
When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance. A well known example for such a case that this paper specifically deals with is the turning operation on a CNC machine. Manufacturing cost of a turning operation is a nonlinear convex function of its processing time. In this paper, we deal with making optimal machine-job assignments and processing time decisions so as to minimize total manufacturing cost while the ...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
S. Gürel and M. S. Akturk, “An anticipative scheduling approach with controllable processing times,”
COMPUTERS & OPERATIONS RESEARCH
, pp. 1002–1013, 2010, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/40123.