scientific article; zbMATH DE number 1264428

MaRDI QIDQ4233364zbMATH OpenFDO

Authors

Publication date 19 August 1999

zbMATH Keywords

maximum completion timemaximum latenessNP-hardnesstime-dependent processing time

Mathematics Subject Classification ID

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

Recommendations

• Parallel-machine scheduling with time dependent processing times
• Single machine scheduling problems with exponentially start time dependent job processing times
• Parallel machine scheduling with time dependent processing times
• Scheduling jobs with piecewise linear decreasing processing times

Cited in

(25)

• Equivalent time-dependent scheduling problems
• Single machine scheduling with deadlines and increasing rates of processing times
• Scheduling simple linear deteriorating jobs with rejection
• Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
• Scheduling jobs with a V-shaped time-dependent processing time
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems
• 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
• Scheduling to minimize makespan about increase of processing times
• The complexity of scheduling starting time dependent tasks with release times
• Job sequencing with exponential functions of processing times
• Online scheduling of simple linear deteriorating jobs to minimize the total general completion time
• Scheduling jobs with piecewise linear decreasing processing times
• Uniform parallel-machine scheduling with time dependent processing times
• scientific article; zbMATH DE number 1859341 (Why is no real title available?)
• scientific article; zbMATH DE number 1859344 (Why is no real title available?)
• Single machine scheduling problems with exponentially start time dependent job processing times
• Algorithms and Computation
• A time-dependent multiple criteria single-machine scheduling problem
• Scheduling dedicated jobs with variative processing times
• A generic approach to proving NP-hardness of partition type problems
• Theory and methodology of time-dependent scheduling: past, present and future
• Scheduling time-dependent jobs under mixed deterioration
• ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4233364)