The following pages link to (Q4068433):
Displaying 9 items.
- A polynomial algorithm to optimally schedule tasks on a virtual distributed system under tree-like precedence constraints (Q582203) (← links)
- Management of periodic demands in distribution systems (Q761974) (← links)
- Formulating the single machine sequencing problem with release dates as a mixed integer program (Q909575) (← links)
- Reducibility among single machine weighted completion time scheduling problems (Q922287) (← links)
- Flow-shops with a dominant machine (Q1203800) (← links)
- Four solution techniques for a general one machine scheduling problem. A comparative study (Q1247365) (← links)
- An SA/TS mixture algorithm for the scheduling tardiness problem (Q1266621) (← links)
- A polynomial algorithm for lot-size scheduling of two type tasks. (Q1853075) (← links)
- A new heuristic for the n-job, M-machine flow-shop problem (Q2277356) (← links)
