z-logo
open-access-imgOpen Access
Stochastic Machine Scheduling to Minimize Waiting Time Related Objectives with Emergency Jobs
Author(s) -
Lianmin Zhang,
Lei Guan,
Ke Zhou
Publication year - 2014
Publication title -
discrete dynamics in nature and society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.264
H-Index - 39
eISSN - 1607-887X
pISSN - 1026-0226
DOI - 10.1155/2014/837910
Subject(s) - computer science , scheduling (production processes) , single machine scheduling , operations research , mathematical optimization , job shop scheduling , operations management , mathematics , engineering , operating system , schedule
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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom