Improved algorithms for two single machine scheduling problems
From MaRDI portal
Publication:860871
DOI10.1016/j.tcs.2006.04.014zbMath1110.68014OpenAlexW2611886938MaRDI QIDQ860871
Huikun Gu, Wei-ya Zhong, Yong He
Publication date: 9 January 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.04.014
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items (30)
Single machine scheduling with job delivery to multiple customers ⋮ Online and semi-online scheduling to minimize makespan on single machine with an availability constraint ⋮ Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval ⋮ Semi-online scheduling on a single machine with unexpected breakdown ⋮ Machine Scheduling with a Maintenance Interval and Job Delivery Coordination ⋮ Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval ⋮ Minimizing total weighted late work on a single-machine with non-availability intervals ⋮ Single Machine Scheduling with an Availability Constraint and Rejection ⋮ On the machine scheduling problem with job delivery coordination ⋮ Coordinated scheduling of the outsourcing, in-house production and distribution operations ⋮ Minimizing total completion time on a single machine with a flexible maintenance activity ⋮ Supply chain scheduling problem in the hospital with periodic working time on a single machine ⋮ Minimizing total weighted completion time with an unexpected machine unavailable interval ⋮ Short‐term scheduling with machine calibration ⋮ The Coordination of Two Parallel Machines Scheduling and Batch Deliveries ⋮ Two-machine flowshop scheduling with intermediate transportation under job physical space consideration ⋮ Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates ⋮ PARALLEL MACHINE SCHEDULING WITH JOB DELIVERY COORDINATION ⋮ Integrated scheduling of production and delivery on a single machine with availability constraint ⋮ Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time ⋮ Scheduling with job delivery coordination on single machine ⋮ Single-machine scheduling with machine unavailability periods and resource dependent processing times ⋮ Machine scheduling with a maintenance interval and job delivery coordination ⋮ Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time ⋮ Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery ⋮ Two parallel machines scheduling with two-vehicle job delivery to minimize makespan ⋮ A new heuristic algorithm for the machine scheduling problem with job delivery coordination ⋮ Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time ⋮ Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness ⋮ Two parallel machines problem with job delivery coordination and availability constraint
Cites Work
- Unnamed Item
- Unnamed Item
- Single machine flow-time scheduling with scheduled maintenance
- Single machine flow-time scheduling with a single breakdown
- A simple proof of the inequality \(\text{FFD}(L)\leq {11 \over 9} \text{OPT}(L)+1\), \(\forall L\) for the FFD bin-packing algorithm
- Machine scheduling with job delivery coordination
- An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
- Fast Approximation Algorithms for Knapsack Problems
This page was built for publication: Improved algorithms for two single machine scheduling problems
