article

On the identical parallel-machine rescheduling with job rework disruption

Authors:

Hong ZhouAuthors Info & Claims

Computers and Industrial Engineering, Volume 66, Issue 1

Pages 186 - 198

https://doi.org/10.1016/j.cie.2013.02.018

Published: 01 September 2013 Publication History

Abstract

This paper investigates an issue of rescheduling on identical parallel machines where the original jobs have already been scheduled to minimize the total completion time, when a single set of jobs to be reworked re-arrives and creates a job rework disruption. Two conflicting rescheduling criteria are considered: the total completion time, as the measure of scheduling cost (efficiency); and the number of jobs assigned to different machines in the original schedule and newly generated schedule, as the measure of disruption cost (stability). Further, the rescheduling problem is defined as a bi-criteria scheduling problem. Two polynomial time algorithms are proposed to lexicographically optimize the two criteria. Besides, the set of all efficient schedules with respect to the two criteria can be also generated in polynomial time.

References

[1]

Rescheduling job shops under random disruptions. International Journal of Production Research. v35. 2065-2082.

[2]

Match-up scheduling under a machine breakdown. European Journal of Operational Research. v112. 81-97.

[3]

Rescheduling of identical parallel machines under machine eligibility constraints. European Journal of Operational Research. v149. 523-532.

[4]

Executing production schedules in the face of uncertainties: A review and some future directions. European Journal of Operational Research. v161. 86-110.

[5]

Parallel-machine rescheduling with machine disruptions. IIE Transactions. v37. 1113-1118.

[6]

Principles of sequencing and scheduling. Wiley, New York.

[7]

Rescheduling in passenger railways: The rolling stock rebalancing problem. Journal of Scheduling. v13. 281-297.

[8]

Chang, Y. L., Sullivan, R. S., & Bagchi, U. (1984). Experimental investigation of quasi-realtime scheduling on flexible manufacturing systems. In Proceedings of the 1st ORSA/ TIMS special interest conference on flexible manufacturing systems, Ann Arbor, MI (pp. 307-312).

[9]

Theory of scheduling. Addison-Wesley, Reading, MA.

[10]

Using real time information for effective dynamic scheduling. European Journal of Operational Research. v139. 230-244.

[11]

Rescheduling parallel machines with stepwise increasing tardiness and machine assignment stability objectives. International Journal of Production Research. v43. 3231-3246.

[12]

Production rescheduling for machine breakdown at a job shop. International Journal of Production Research. v50. 2681-2691.

[13]

An approach to predictive-reactive scheduling of parallel machines subject to disruptions. Annals of Operations Research. v159. 65-82.

[14]

An overview of techniques for solving multiobjective mathematical programs. Management Science. v30. 1268-1282.

[15]

A generic deadlock-free reactive scheduling approach. International Journal of Production Research. v47. 5657-5676.

[16]

Optimization and approximation in deterministic machine scheduling: A survey. Annals of Discrete Mathematics. v5. 287-326.

[17]

Rescheduling and optimization of schedules considering machine failures. International Journal of Production Economics. v60-61. 503-513.

[18]

Rescheduling for new orders. Operations Research. v52. 440-453.

[19]

Rescheduling for job unavailability. Operations Research. v58. 746-755.

[20]

Rescheduling for multiple new orders. INFORMS Journal on Computing. v19. 633-645.

[21]

Multicriteria scheduling. European Journal of Operational Research. v167. 592-623.

[22]

Production scheduling/rescheduling in flexible manufacturing. International Journal of Production Research. v35. 281-309.

[23]

Kaspi, M., & Montreuil, B., 1988. On the scheduling of identical parallel processors with arbitrary initial processor available times. Research memorandum no. 88-12, USA: School of Industrial Engineering, Purdue University.

[24]

Two machine scheduling under disruptions with transportation considerations. Journal of Scheduling. v9. 35-48.

[25]

A production rescheduling expert simulation system. European Journal of Operational Research. v124. 283-293.

[26]

A heuristic rescheduling algorithm for computer-based production scheduling systems. International Journal of Production Research. v31. 1815-1826.

[27]

Flow-time performance of modified scheduling heuristics in a dynamic rescheduling environment. Computers & Industrial Engineering. v31. 213-216.

[28]

Simulation modeling of a dynamic job shop rescheduling with machine availability constraints. Computers & Industrial Engineering. v35. 117-120.

[29]

Rescheduling strategies for minimizing total weighted tardiness in complex job shops. International Journal of Production Research. v42. 613-628.

[30]

Job shop scheduling heuristics and frequency of scheduling. International Journal of Production Research. v20. 227-241.

[31]

Centralized scheduling and priority implementation heuristics for a dynamic job shop model. IIE Transactions. v9. 95-102.

[32]

A survey of dynamic scheduling in manufacturing systems. Journal of Scheduling. v12. 417-431.

[33]

Generating all efficient solutions of a rescheduling problem on unrelated parallel machines. International Journal of Production Research. v47. 5245-5270.

[34]

Rescheduling unrelated parallel machines with total flow time and total disruption cost criteria. Journal of the Operational Research Society. v62. 152-164.

[35]

Scheduling: Theory, algorithms, and systems. 3rd ed. Springer, New York.

[36]

Dynamic rescheduling that simultaneously considers efficiency and stability. Computers & Industrial Engineering. v46. 1-15.

[37]

Rescheduling of parallel machines under machine failures. Advanced Materials Research. 724-730.

[38]

Various optimizers for single-stage production. Naval Research Logistics Quarterly. v3. 59-66.

[39]

Dynamic scheduling - A survey of research. International Journal of Production Economics. v32. 53-63.

[40]

Capability of cumulative delay based reactive scheduling for job shops with machine breakdowns. Computers & Industrial Engineering. v53. 63-78.

[41]

A black board based perspective of reactive scheduling. In: Artificial intelligence in reactive scheduling, Chapman & Hall, London. pp. 60-77.

[42]

Toward a hybrid intelligent system for scheduling and rescheduling of FMS. International Journal of Computer Integrated Manufacturing. v1. 154-164.

[43]

Parallel machine scheduling under the disruption of machine breakdown. Industrial & Engineering Chemistry Research. v48. 6660-6667.

[44]

Multicriteria scheduling: Theory, models and algorithms. 2nd ed. Springer, Berlin.

[45]

Rescheduling on a single machine with part-type dependent setup times and deadlines. Annals of Operations Research. v70. 93-113.

[46]

Heuristic procedures for reactive project scheduling. Computers & Industrial Engineering. v52. 11-28.

[47]

Rescheduling manufacturing systems: A framework of strategies, policies, and methods. Journal of Scheduling. v6. 39-62.

[48]

Real-time GA-based rescheduling approach for the pre-sewing stage of an apparel manufacturing process. International Journal of Advanced Manufacturing Technology. v25. 180-188.

[49]

One-machine rescheduling heuristics with efficiency and stability as criteria. Computers & Operations Research. v20. 1-14.

[50]

Scheduling/rescheduling in the manufacturing operating system environment. International Journal of Production Research. v23. 705-722.

[51]

Single machine rescheduling with new jobs arrivals and processing time compression. International Journal of Advanced Manufacturing Technology. v34. 378-384.

[52]

A new era for crew recovery at continental airlines. Interfaces. v33. 5-22.

[53]

Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption. European Journal of Operational Research. v182. 936-944.

[54]

Rescheduling with release dates to minimize total sequence disruption under a limit on the makespan. Asia-Pacific Journal of Operational Research. v24. 789-796.

[55]

Genetic algorithms for match-up rescheduling of the flexible manufacturing systems. Computers & Industrial Engineering. v62. 670-686.

[56]

Rescheduling problems with deteriorating jobs under disruptions. Applied Mathematical Modelling. v34. 238-243.

[57]

A dynamic rescheduling model with multi-agent system and its solution method. Journal of Mechanical Engineering. v58. 81-92.

[58]

Scheduling and rescheduling with iterative repair. IEEE Transactions on Systems, Man and Cybernetics. v23. 1588-1596.

Cited By

Ferreira CFigueira GAmorim PPigatti A(2023)Scheduling wagons to unload in bulk cargo ports with uncertain processing timesComputers and Operations Research10.1016/j.cor.2023.106364160:COnline publication date: 1-Dec-2023
https://dl.acm.org/doi/10.1016/j.cor.2023.106364
Rambod MRezaeian J(2018)Robust meta-heuristics implementation for unrelated parallel machines scheduling problem with rework processes and machine eligibility restrictionsComputers and Industrial Engineering10.1016/j.cie.2014.09.00677:C(15-28)Online publication date: 29-Dec-2018
https://dl.acm.org/doi/10.1016/j.cie.2014.09.006

On the identical parallel-machine rescheduling with job rework disruption
1. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
    2. Online algorithms
      1. Online learning algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning

Recommendations

Minimization of Job Waiting Time Variance on Identical Parallel Machines

We consider the problem of scheduling independent jobs on identical parallel machines so as to minimize the waiting time variance of the jobs (Pm//WTV). We show that the optimal value of(Pm//WTV) is identical to the optimal value of the problem for ...
Rescheduling of flexible job shops under machine breakdowns
ICS'06: Proceedings of the 10th WSEAS international conference on Systems

In today's competitive environment rescheduling is a necessary evil in case of shop floor disturbances like machine breakdown. This paper gives a robust rescheduling strategy to deal with such situation in the flexible job shop environment. An effective ...
A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates

In this paper, we consider an identical parallel machine scheduling problem with release dates. The objective is to minimize the total weighted completion time. This problem is known to be strongly NP-hard. We propose some dominance properties and two ...

Comments

Information & Contributors

Information

Published In

cover image Computers and Industrial Engineering

Computers and Industrial Engineering Volume 66, Issue 1

September, 2013

200 pages

ISSN:0360-8352

Issue’s Table of Contents

Copyright © Elsevier Ltd © 2013.

Publisher

Pergamon Press, Inc.

United States

Publication History

Published: 01 September 2013

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Ferreira CFigueira GAmorim PPigatti A(2023)Scheduling wagons to unload in bulk cargo ports with uncertain processing timesComputers and Operations Research10.1016/j.cor.2023.106364160:COnline publication date: 1-Dec-2023
https://dl.acm.org/doi/10.1016/j.cor.2023.106364
Rambod MRezaeian J(2018)Robust meta-heuristics implementation for unrelated parallel machines scheduling problem with rework processes and machine eligibility restrictionsComputers and Industrial Engineering10.1016/j.cie.2014.09.00677:C(15-28)Online publication date: 29-Dec-2018
https://dl.acm.org/doi/10.1016/j.cie.2014.09.006

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents