The one-machine just-in-time scheduling problem with preemption
β Scribed by Yann Hendel; Nina Runge; Francis Sourd
- Book ID
- 108114383
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 968 KB
- Volume
- 6
- Category
- Article
- ISSN
- 1572-5286
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract In this article, singleβmachine scheduling problems with learning effects of setup and removal times and deterioration effects of processing time are considered. The objective function of the problem is minimization of the weighted sum of total earliness and total tardiness. To get an e
This note revisits the maximum deviation just-in-time (MDJIT) scheduling problem previously investigated by Steiner and Yeomans. Its main result is a set of algebraic necessary and su cient conditions for the existence of a MDJIT schedule with a given objective function value. These conditions are u
Traditional machining economics looks into the optimal set of machining conditions under which the production cost or time per part is minimized. No due dates are included in the consideration. Job sequencing searches for the optimal order of jobs so that lateness and/or earliness is minimized. The