Stochastic Machine Scheduling to Minimize Waiting Time Related Objectives with Emergency Jobs

We consider a new scheduling model where emergency jobs appear during the processing of current jobs and must be processed immediately after the present job is completed. All jobs have random processing times and should be completed on a single machine. The most common case of the model is the surge...

Full description

Saved in:
Bibliographic Details
Main Authors: Lianmin Zhang, Lei Guan, Ke Zhou
Format: Article
Language:English
Published: Wiley 2014-01-01
Series:Discrete Dynamics in Nature and Society
Online Access:http://dx.doi.org/10.1155/2014/837910
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider a new scheduling model where emergency jobs appear during the processing of current jobs and must be processed immediately after the present job is completed. All jobs have random processing times and should be completed on a single machine. The most common case of the model is the surgery scheduling problem, where some elective surgeries are to be arranged in an operation room when emergency cases are coming during the operating procedure of the elective surgeries. Two objective functions are proposed to display this practice in machine scheduling problem. One is the weighted sum of the waiting times and the other is the weighted discounted cost function of the waiting times. We address some optimal policies to minimize these objectives.
ISSN:1026-0226
1607-887X