๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Complexity of single machine scheduling problems under scenario-based uncertainty

โœ Scribed by Mohamed Ali Aloulou; Federico Della Croce

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
256 KB
Volume
36
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

โœฆ Synopsis

We present algorithmic and computational complexity results for several single machine scheduling problems where some job characteristics are uncertain. This uncertainty is modeled through a finite set of well-defined scenarios. We use here the so-called absolute robustness criterion to select among feasible solutions.

๐Ÿ“œ SIMILAR VOLUMES

Single machine scheduling to minimize th
Single machine scheduling to minimize the number of late jobs under uncertainty
โœ Shao Chin Sung; Milan Vlach ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 227 KB

In this paper, we deal with the problem of sequencing a รฟnite number of jobs for processing by a single machine with the objective of minimizing the number of jobs that are not completed by their due dates. We propose a rather general model based on an algebraic approach. By specifying suitable bina

Single machine scheduling problems under
Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning
โœ M. Duran Toksarฤฑ; Daniel Oron; Ertan Gรผner ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 417 KB

Job deterioration and machine learning co-exist in various real life scheduling settings. This paper studies several single machine scheduling problems under the joint effect of nonlinear job deterioration and time-dependent learning. We assume that the processing time of a job increases when its pr

Notes on โ€œSingle machine scheduling prob
Notes on โ€œSingle machine scheduling problems under the effects of nonlinear deterioration and time-dependent learningโ€
โœ Yunqiang Yin; Dehua Xu ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 181 KB

We show by means of examples that Theorems 1-4 in Toksarฤฑ et al. [M.D. Toksarฤฑ, D. Oron, E. Gรผner, Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning, Mathematical and Computer Modelling 50 (2009) 401-406] are incorrect.

A two-agent single-machine scheduling pr
A two-agent single-machine scheduling problem with truncated sum-of-processing-times-based learning considerations
โœ T.C.E. Cheng; Shuenn-Ren Cheng; Wen-Hung Wu; Peng-Hsiang Hsu; Chin-Chia Wu ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 224 KB

Scheduling with learning effects has received a lot of research attention lately. By learning effect, we mean that job processing times can be shortened through the repeated processing of similar tasks. On the other hand, different entities (agents) interact to perform their respective tasks, negoti