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

The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times

โœ Scribed by Dvir Shabtay; George Steiner

Publisher
Springer US
Year
2007
Tongue
English
Weight
375 KB
Volume
159
Category
Article
ISSN
0254-5330

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Due-date assignment and single machine s
Due-date assignment and single machine scheduling with compressible processing times
โœ T.C.E. Cheng; C. Oวงuz; X.D. Qi ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 588 KB

In this paper we consider a due-date assignment and single machine scheduling problem in which the jobs have compressible processing times. Two models are defined according to the due-date assignment methods used. The first model applies the common (constant) due-date assignment method to assign the

Sequencing and due-date determination in
Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs
โœ Soroush H.M. ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 215 KB

This paper studies the problem of simultaneous due-date determination and sequencing of a set of n jobs on a single machine where processing times are random variables and job earliness and tardiness costs are distinct. The objective is to determine the optimal sequence and the optimal due-dates whi

Single-machine scheduling with learning
Single-machine scheduling with learning effect and resource-dependent processing times
โœ Dan Wang; Ming-Zheng Wang; Ji-Bo Wang ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 206 KB

We consider resource allocation scheduling with learning effect in which the processing time of a job is a function of its position in a sequence and its resource allocation. The objective is to find the optimal sequence of jobs and the optimal resource allocation separately. We concentrate on two g

Two due date assignment problems with po
Two due date assignment problems with position-dependent processing time on a single-machine
โœ Chou-Jung Hsu; Suh-Jenq Yang; Dar-Li Yang ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 193 KB

The focus of this study is to analyze single-machine scheduling and due date assignment problems with position-dependent processing time. Two generally positional deterioration models and two frequent due date assignment methods are investigated. The objective functions include the cost of changing