Pages that link to "Item:Q1853737"
From MaRDI portal
The following pages link to PERT scheduling with convex cost functions. (Q1853737):
Displayed 14 items.
- A two-stage stochastic programming approach for project planning with uncertain activity durations (Q835555) (← links)
- An improved earliness--tardiness timing algorithm (Q878565) (← links)
- Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date (Q947941) (← links)
- The one-machine just-in-time scheduling problem with preemption (Q1013290) (← links)
- An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions (Q1772863) (← links)
- Optimal timing of a sequence of tasks with general completion costs (Q1776957) (← links)
- Earliness-tardiness scheduling with setup considerations (Q1777159) (← links)
- Lagrangian bounds for just-in-time job-shop scheduling (Q2456651) (← links)
- A recovering beam search algorithm for the single machine just-in-time scheduling problem (Q2488909) (← links)
- Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem (Q2491772) (← links)
- Minimizing the earliness--tardiness costs on a single machine (Q2499156) (← links)
- Multicriteria scheduling (Q2566699) (← links)
- Punctuality and idleness in just-in-time scheduling (Q2566707) (← links)
- Optimal release times in single-stage manufacturing systems with blocking: optimal control perspective (Q2569200) (← links)