Publication:4233364
From MaRDI portal
zbMath0918.90085MaRDI QIDQ4233364
No author found.
Publication date: 19 August 1999
90C60: Abstract computational complexity for mathematical programming problems
90B35: Deterministic scheduling theory in operations research
Related Items
A time-dependent multiple criteria single-machine scheduling problem, Online scheduling of simple linear deteriorating jobs to minimize the total general completion time, Uniform parallel-machine scheduling with time dependent processing times, A generic approach to proving NP-hardness of partition type problems, Scheduling time-dependent jobs under mixed deterioration, ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation, Equivalent time-dependent scheduling problems, Scheduling simple linear deteriorating jobs with rejection, Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine, Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences, Pareto and scalar bicriterion optimization in scheduling deteriorating jobs, An FPTAS for the weighted number of tardy jobs minimization on a single machine with deteriorating jobs
