Pages that link to "Item:Q3100485"
From MaRDI portal
The following pages link to A Note on the Optimality Proof of the Kise-Ibaraki-Mine Algorithm (Q3100485):
Displaying 8 items.
- A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
- An alternative proof of the Kawaguchi-Kyan bound for the largest-ratio-first rule (Q433121) (← links)
- A note on ``Coordination of production and distribution planning'' by P. Chandra and M. L. Fisher (Q856257) (← links)
- Corrigendum to: ``Solving the job-shop scheduling problem optimally by dynamic programming'' (Q1652100) (← links)
- A revised proof of the optimality for the Kise-Ibaraki-Mine algorithm (Q1926639) (← links)
- Tower-of-sets analysis for the Kise-Ibaraki-Mine algorithm (Q2377225) (← links)
- Optimality proof of the Kise-Ibaraki-Mine algorithm (Q2434284) (← links)
- A note ‘On a single machine-scheduling problem with separated position and resource effects’ (Q2808333) (← links)