Single machine earliness-tardiness scheduling with resource-dependent release dates
From MaRDI portal
Publication:1847239
DOI10.1016/S0377-2217(01)00292-2zbMath1081.90562MaRDI QIDQ1847239
José A. Ventura, Daecheol Kim, Frederic Garriga
Publication date: 17 November 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Multi-objective and goal programming (90C29) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
Scheduling with compressible and stochastic release dates ⋮ Single machine scheduling problems with resource dependent release times ⋮ Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption ⋮ Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
Cites Work
- Unnamed Item
- Unnamed Item
- Time-optimal control in a single machine problem with resource constraints
- Single machine scheduling problem with a common deadline and resource dependent release dates
- On minimizing resource consumption with constraints on the makespan and the total completion time
- Scheduling to minimize the total weighted completion time with a constraint on the release time resource consumption
- An improved dynamic programming algorithm for the single-machine mean absolute deviation problem with a restrictive common due date
- Minimizing the sum of absolute lateness in single-machine and multimachine scheduling
- Minimizing the average deviation of job completion times about a common due date
- Sequencing with Earliness and Tardiness Penalties: A Review
- Minimizing mean absolute deviation of completion times about a common due date
- One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
- Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
- `` Strong NP-Completeness Results
- Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times
- Scheduling with resource-dependent release dates—a comparison of two different resource consumption functions
- Single machine sequencing with linear models of release dates
- A note on ‘Single-machine scheduling for minimizing total cost with identical, asymmetrical earliness and tardiness penalties’
- Scheduling to minimize release-time resource consumption and tardiness penalties
This page was built for publication: Single machine earliness-tardiness scheduling with resource-dependent release dates
