Scheduling with generalized batch delivery dates and earliness penalties
β Scribed by Xiaoguang Yang
- Book ID
- 110252902
- Publisher
- Taylor and Francis Group
- Year
- 2000
- Tongue
- English
- Weight
- 139 KB
- Volume
- 32
- Category
- Article
- ISSN
- 0740-817X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We consider in this paper the single-machine preemptive scheduling problem with job release dates, delivery times and preemption penalties, where each time a job is started, whether initially or after preemption, a job-dependent setup must take place. First, we prove that the problem is strongly NP-
We consider a stochastic counterpart of the well-known earliness-tardiness scheduling problem with a common due date, in which n stochastic jobs are to be processed on a single machine. The processing times of the jobs are independent and normally distributed random variables with known means and kn