Scheduling two chains of unit jobs on one machine: A polyhedral study
✍ Scribed by Claudio Arbib; Martine Labbé; Mara Servilio
- Publisher
- John Wiley and Sons
- Year
- 2011
- Tongue
- English
- Weight
- 190 KB
- Volume
- 58
- Category
- Article
- ISSN
- 0028-3045
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The paper considers the open shop scheduling problem to minimize the makespan, provided that one of the machines has to process the jobs according to a given sequence. We show that in the preemptive case the problem is polynomially solvable for an arbitrary number of machines. If preemption is not a
13C NMR inversion-recovery cross-polarization experiments are used to study the phase structure and partitioning of main and side-chain groups in a homogeneous, metallocene-based, ethylene-1-octene copolymer. The results provide strong evidence for a three-phase model, i.e. a rigid, (imperfect) crys