Publication:3690568
From MaRDI portal
zbMath0572.90054MaRDI QIDQ3690568
Publication date: 1984
Pareto sets; bicriterion problem; epsilon-approximation; parallel, unrelated machines; scheduling independent nonpreemptable tasks
90B35: Deterministic scheduling theory in operations research
Related Items
A survey of results for sequencing problems with controllable processing times, Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: Worst-case analysis, Single machine scheduling with controllable processing times and compression costs. I: Equal times and costs, Group scheduling with controllable setup and processing times: minimizing total weighted completion time, A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times