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

Sequencing jobs on a single machine with a common due date and stochastic processing times

โœ Scribed by Subhash C. Sarin; Erdal Erel; George Steiner

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
561 KB
Volume
51
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On a single-machine optimal constant due
On a single-machine optimal constant due-date assignment and sequencing problem
โœ TCE Cheng ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 164 KB

This paper considers the problem of optimal constant due-date assignment and sequencing of jobs in a single-machine shop. We formulate the problem as a general constrained optimization problem and apply the Kuhn-Tucker conditions to find the optimal solution which is shown to be independent of the j

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