A multi-objective approach to resource allocation in single machine scheduling
From MaRDI portal
Publication:1173857
DOI10.1016/0377-2217(90)90376-MzbMath0825.90535MaRDI QIDQ1173857
Publication date: 25 June 1992
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)
Related Items
Incorporating preference information into multi-objective scheduling ⋮ Convex resource allocation for minimizing the makespan in a single machine with job release dates ⋮ A tabu-search heuristic for the flexible-resource flow shop scheduling problem ⋮ A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling ⋮ Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine ⋮ Minimizing the total weighted flow time in a single machine with controllable processing times ⋮ Single machine batch scheduling to minimize total completion time and resource consumption costs ⋮ A bicriterion objective for levelling the schedule of a mixed-model, \(JIT\) assembly process ⋮ A survey of scheduling with controllable processing times ⋮ A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times ⋮ Multiple and bicriteria scheduling: A literature survey ⋮ Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times ⋮ Improving fleet utilization for carriers by interval scheduling ⋮ The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times ⋮ Resource cost aware scheduling ⋮ A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates ⋮ Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity ⋮ Parallel machine scheduling with a convex resource consumption function ⋮ An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times ⋮ An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times
Cites Work
- Time-optimal control in a single machine problem with resource constraints
- A bicriterion approach to time/cost trade-offs in sequencing
- Job-shop scheduling with resource-time models of operations
- Scheduling with Multiple Performance Measures: The One-Machine Case
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
