The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times

DOI10.1016/S0898-1221(98)00099-6zbMATH Open0992.90027OpenAlexW2012916760MaRDI QIDQ1608433FDOQ1608433

Authors: T. C. Edwin Cheng, Q. Ding 

Publication date: 6 August 2002

Published in: Computers & Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(98)00099-6

Recommendations

• Single machine scheduling with deadlines and increasing rates of processing times
• A note on single-machine scheduling with decreasing time-dependent job processing times
• Single machine scheduling subject to deadlines and resource dependent processing times
• Single-machine scheduling to minimize total absolute differences in waiting times with deteriorating jobs
• Two models of single machine scheduling with general processing time functions
• Scheduling problems on two sets of identical machines
• Dual decomposition of a single-machine scheduling problem
• scientific article; zbMATH DE number 1594558
• Complexity of single machine, multi-criteria scheduling problems
• Time complexity of single machine scheduling with stochastic precedence constraints

zbMATH Keywords

computational complexityschedulingsingle machinemakespansequencingtime-dependence

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Title not available (Why is that?)
• Complexity of scheduling tasks with time-dependent execution times
• The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times

Cited In (5)

• The complexity of scheduling starting time dependent tasks with release times
• The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times
• Single machine scheduling with step-deteriorating processing times
• Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
• A concise survey of scheduling with time-dependent processing times

This page was built for publication: The complexity of single machine scheduling with two distinct deadlines and identical decreasing rates of processing times

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