scientific article; zbMATH DE number 1264428

zbMath0918.90085MaRDI QIDQ4233364

No author found.

Publication date: 19 August 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

NP-hardnessmaximum completion timemaximum latenesstime-dependent processing time

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)

Related Items (13)

An FPTAS for the weighted number of tardy jobs minimization on a single machine with deteriorating jobs ⋮ A generic approach to proving NP-hardness of partition type problems ⋮ Online scheduling of simple linear deteriorating jobs to minimize the total general completion time ⋮ Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences ⋮ Uniform parallel-machine scheduling with time dependent processing times ⋮ Scheduling simple linear deteriorating jobs with rejection ⋮ Scheduling time-dependent jobs under mixed deterioration ⋮ A time-dependent multiple criteria single-machine scheduling problem ⋮ ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems ⋮ Equivalent time-dependent scheduling problems ⋮ Pareto and scalar bicriterion optimization in scheduling deteriorating jobs ⋮ Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine

This page was built for publication: