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

Dvir Shabtay, Miri Gilenson

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish
Title of host publicationThe SECOND international workshop on dynamic scheduling problem
PublisherPolish Mathematical Society
Pages85-89
ISBN (Electronic): 978-83-937220-9-9
ISBN (Print)978-83-937220-8-2
StatePublished - 2018

Fingerprint

Dive into the research topics of 'The multi-scenario scheduling problem to maximize the weighted number of just-in-time jobs'. Together they form a unique fingerprint.

Cite this