PERT scheduling with convex cost functions.
From MaRDI portal
Publication:1853737
DOI10.1016/S0304-3975(01)00220-1zbMath1059.90066MaRDI QIDQ1853737
Francis Sourd, Philippe Chrétienne
Publication date: 22 January 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items
A polarized adaptive schedule generation scheme for the resource-constrained project scheduling problem ⋮ A two-stage stochastic programming approach for project planning with uncertain activity durations ⋮ An improved earliness--tardiness timing algorithm ⋮ Lagrangian bounds for just-in-time job-shop scheduling ⋮ Multicriteria models for just-in-time scheduling ⋮ Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date ⋮ A recovering beam search algorithm for the single machine just-in-time scheduling problem ⋮ Stochastic task networks -- trading performance for stability ⋮ Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem ⋮ An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions ⋮ Optimal timing of a sequence of tasks with general completion costs ⋮ Earliness-tardiness scheduling with setup considerations ⋮ Minimizing the earliness--tardiness costs on a single machine ⋮ The one-machine just-in-time scheduling problem with preemption ⋮ Multicriteria scheduling ⋮ Punctuality and idleness in just-in-time scheduling ⋮ Optimal release times in single-stage manufacturing systems with blocking: optimal control perspective
Cites Work
- Resource-constrained project scheduling: Notation, classification, models, and methods
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Optimal timing schedules in earliness-tardiness single machine sequencing
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
