Parallel machine match-up scheduling with manufacturing cost considerations

Download

index.pdf

Date

2010-02-01

Author

Akturk, M. Selim
Atamturk, Alper
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

101
views

61
downloads

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 function of the compression on the processing time. In rescheduling it is highly desirable to catch up the original schedule as soon as possible by reassigning the jobs to the machines and compressing their processing times. On the other hand, one must also keep the manufacturing cost due to compression of the jobs low. Thus, one is faced with a tradeoff between matchup time and manufacturing cost criteria. We introduce alternative match-up scheduling problems for finding schedules on the efficient frontier of this time/cost tradeoff.

Subject Keywords

Management Science and Operations Research, General Engineering, Software, Artificial Intelligence

URI

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

Journal

JOURNAL OF SCHEDULING

DOI

https://doi.org/10.1007/s10951-009-0111-2

Collections

Department of Industrial Engineering, Article

Suggestions

OpenMETU
Core

An anticipative scheduling approach with controllable processing times Gürel, Sinan; Akturk, M. Selim (Elsevier BV, 2010-06-01) 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 decision...
Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm Solyali, O.; Ozpeynirci, O. (Informa UK Limited, 2009-01-01) This study addresses the operational fixed job scheduling problem under spread time constraints. The problem is to select a subset of jobs having fixed ready times and deadlines for processing on identical parallel machines such that total weight of the selected jobs is maximised. We first give a mathematical formulation of the problem and then reformulate it using Dantzig-Wolfe decomposition. We propose a branch-and-price algorithm that works on the reformulation of the problem. Computational results show ...
Working time constraints in operational fixed job scheduling Eliiyi, Deniz Tuersel; Azizoğlu, Meral (Informa UK Limited, 2010-01-01) In this study we consider the operational fixed job scheduling problem under working time limitations. The problem has several practical implications in both production and service operations; however the relevant research is scarce. We analyse pre-emptive and non pre-emptive versions of the problem and its special cases. We provide polynomial-time algorithms for some special cases. We show that the non pre-emptive jobs problem is strongly NP-hard, and propose a branch-and-bound algorithm that employs effic...
A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems Chung, Chia-Shin; Flynn, James; Kırca, Ömer (Elsevier BV, 2006-10-01) The m-machine permutation flowshop problem with the total tardiness objective is a common scheduling problem, which is known to be NP-hard. Here, we develop a branch and bound algorithm to solve this problem. Our algorithm incorporates a machine-based lower bound and a dominance test for pruning nodes. We undertake a numerical study that evaluates our algorithm and compares it with the best alternative existing algorithm. Extensive computational experiments indicate that our algorithm performs better and ca...
Due date and cost-based FMS loading, scheduling and tool management Turkcan, Ayten; Akturk, M. Selim; Storer, Robert H. (Informa UK Limited, 2007-03-01) In this study, we consider flexible manufacturing system loading, scheduling and tool management problems simultaneously. Our aim is to determine relevant tool management decisions, which are machining conditions selection and tool allocation, and to load and schedule parts on non-identical parallel CNC machines. The dual objectives are minimization of the manufacturing cost and total weighted tardiness. The manufacturing cost is comprised of machining and tooling costs (which are affected by machining cond...

Citation Formats

M. S. Akturk, A. Atamturk, and S. Gürel, “Parallel machine match-up scheduling with manufacturing cost considerations,” JOURNAL OF SCHEDULING, pp. 95–110, 2010, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/39262.