Job release scheduling problem: complexity and an approximation algorithm

DOI10.1016/J.DAM.2012.10.011MaRDI QIDQ1946231zbMATH OpenOpenAlexFDO

Authors Byung-Cheon Choi, Jibok Chung

Publication date 18 April 2013

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2012.10.011

zbMATH Keywords

approximation algorithmcomputational complexityschedulingvariability

Mathematics Subject Classification ID

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

Recommendations

• Approximation Algorithms for Fixed Job Schedule Problems
• Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
• Approximability of scheduling problems with resource consuming jobs
• Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
• Approximability of scheduling with fixed jobs
• scientific article; zbMATH DE number 1264427
• Scheduling problems with position dependent job processing times: computational complexity results
• The complexity of mean flow time scheduling problems with release times
• Approximation algorithms for scheduling parallel jobs
• On Scheduling Unit-Length Jobs with Multiple Release Time/Deadline Intervals

Cited in

(5)

• Scheduling jobs with release times on a machine with finite storage
• Scheduling jobs with release and delivery times subject to nested eligibility constraints
• A closed-form solution for the optimal release times for the \(F2|\) deteriorating jobs \(|\sum w_{j}c_{j}\) problem
• Scheduling of inventory releasing jobs to satisfy time-varying demand: an analysis of complexity
• Subdivision-based digital geometry processing as a fundamental building block of digital manufacturing

This page was built for publication: Job release scheduling problem: complexity and an approximation algorithm

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