The multi-scenario scheduling problem to maximize the weighted number of just-in-time jobs

Dvir Shabtay; Miri Gilenson

doi:10.14708/isbn.978-83-951298-0-3p87-91

The multi-scenario scheduling problem to maximize the weighted number of just-in-time jobs

Dvir Shabtay, Miri Gilenson

Department of Industrial Engineering and Management

Ben-Gurion University of the Negev

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

In this paper we study a set of single-machine and flow-shop scheduling problems with scenario-dependent jobs’ parameters. Our aim is to find a schedule
that is feasible under all scenarios and maximizes the weighted number of jobs
completed exactly at their due-date, i.e., completed in a just-in-time (JIT) mode.
Our set of problems can be formally defined as follows

Original language	American English
Title of host publication	The SECOND international workshop on dynamic scheduling problem
Publisher	Polish Mathematical Society
Pages	85-89
ISBN (Electronic)	9788393722099
ISBN (Print)	9788393722082
DOIs	https://doi.org/10.14708/isbn.978-83-951298-0-3p87-91
State	Published - 2018

Access to Document

10.14708/isbn.978-83-951298-0-3p87-91

Cite this

@inproceedings{f8dcfbc306a946d0aec4148d29f86dd4,

title = "The multi-scenario scheduling problem to maximize the weighted number of just-in-time jobs",

abstract = "In this paper we study a set of single-machine and flow-shop scheduling problems with scenario-dependent jobs{\textquoteright} parameters. Our aim is to find a schedulethat is feasible under all scenarios and maximizes the weighted number of jobscompleted exactly at their due-date, i.e., completed in a just-in-time (JIT) mode.Our set of problems can be formally defined as follows",

author = "Dvir Shabtay and Miri Gilenson",

year = "2018",

doi = "10.14708/isbn.978-83-951298-0-3p87-91",

language = "American English",

isbn = "9788393722082",

pages = "85--89",

booktitle = "The SECOND international workshop on dynamic scheduling problem",

publisher = "Polish Mathematical Society",

address = "Poland",

}

TY - GEN

T1 - The multi-scenario scheduling problem to maximize the weighted number of just-in-time jobs

AU - Shabtay, Dvir

AU - Gilenson, Miri

PY - 2018

Y1 - 2018

N2 - In this paper we study a set of single-machine and flow-shop scheduling problems with scenario-dependent jobs’ parameters. Our aim is to find a schedulethat is feasible under all scenarios and maximizes the weighted number of jobscompleted exactly at their due-date, i.e., completed in a just-in-time (JIT) mode.Our set of problems can be formally defined as follows

AB - In this paper we study a set of single-machine and flow-shop scheduling problems with scenario-dependent jobs’ parameters. Our aim is to find a schedulethat is feasible under all scenarios and maximizes the weighted number of jobscompleted exactly at their due-date, i.e., completed in a just-in-time (JIT) mode.Our set of problems can be formally defined as follows

U2 - 10.14708/isbn.978-83-951298-0-3p87-91

DO - 10.14708/isbn.978-83-951298-0-3p87-91

M3 - Conference contribution

SN - 9788393722082

SP - 85

EP - 89

BT - The SECOND international workshop on dynamic scheduling problem

PB - Polish Mathematical Society

ER -

The multi-scenario scheduling problem to maximize the weighted number of just-in-time jobs

Abstract

Access to Document

Fingerprint

Cite this