Two Machine Scheduling under Disruptions with Transportation Considerations

Authors:
Chung-Yee Lee;Joseph Y-T. Leung;Gang Yu
Affiliations:
Department of Industrial Engineering & Engineering Management, The Hong Kong University of Science and Technology, Hong Kong;Department of Computer Science, New Jersey Institute of Technology, Newark, USA 07102;Department of Management Science and Information Systems, McCombs School of Business, The University of Texas at Austin, USA
Venue:
Journal of Scheduling
Year:
2006

Citing 8
Cited 7

Single machine flow-time scheduling with a single breakdown

Acta Informatica
Matchup scheduling with multiple resources, release dates and disruptions

Operations Research
Scheduling Algorithms

Scheduling Algorithms
Scheduling Computer and Manufacturing Processes

Scheduling Computer and Manufacturing Processes
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A New Era for Crew Recovery at Continental Airlines

Interfaces
Scheduling with Fixed Delivery Dates

Operations Research
Supply chain scheduling: Batching and delivery

Operations Research

A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times

Computers and Operations Research
Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs

Operations Research
A new heuristic algorithm for the machine scheduling problem with job delivery coordination

Theoretical Computer Science
Production-transportation scheduling model on a single batching machine

CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
Single machine scheduling under potential disruption

Operations Research Letters
Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption

Journal of Scheduling
On the identical parallel-machine rescheduling with job rework disruption

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Effective logistics scheduling requires synchronization of manufacturing and delivery to optimize customer service at minimum total cost. In this paper, we study a new scheduling problem that arises in a disruption environment. Such a problem occurs when a disruption unexpectedly happens, and consequently, some machines become unavailable for certain periods. Jobs that are assigned to the disrupted machines and have not yet been processed can either be moved to other available machines for processing, which may involve additional transportation time and cost, or can be processed by the same machine after the disruption. Our goal is to reschedule jobs so that an objective function, including the original cost function, and possibly transportation costs and disruption cost caused by deviating from the originally planned completion times, is minimized. In this paper, we focus on the two-machine case to demonstrate some major properties, and hope that these properties can provide insights for solving other general problems, such as multiple (more than two) machine scheduling and machine scheduling in other configurations (job shop or flow shop) under disruption. We study problems with different related costs. In each problem, we either provide a polynomial algorithm to solve the problem optimally, or show its NP-hardness. If the problem is NP-hard in the ordinary sense, we also present a pseudo-polynomial algorithm to solve the problem optimally.