Improved algorithms for two single machine scheduling problems
From MaRDI portal
(Redirected from Publication:860871)
Recommendations
- Algorithmic Applications in Management
- Heuristics for the two-machine scheduling problem with a single server
- Algorithms for some maximization scheduling problems on a single machine
- An improved algorithm for scheduling two identical machines with batch delivery consideration
- Improved algorithms for single machine scheduling with release dates and rejections
- An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time
- An improved approximation algorithm for single machine scheduling with job delivery
- An approximation algorithm for two-machine scheduling with an availability constraint
- scientific article; zbMATH DE number 5630095
- scientific article; zbMATH DE number 6531341
Cites work
- scientific article; zbMATH DE number 563208 (Why is no real title available?)
- scientific article; zbMATH DE number 1182767 (Why is no real title available?)
- 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
- An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
- Fast Approximation Algorithms for Knapsack Problems
- Machine scheduling with job delivery coordination
- Single machine flow-time scheduling with a single breakdown
- Single machine flow-time scheduling with scheduled maintenance
Cited in
(35)- Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates
- Comparative evaluation of heuristic algorithms for the single machine scheduling problem with two operations per job and time-lags
- On the machine scheduling problem with job delivery coordination
- Complexity and approximation of single machine scheduling with an operator non-availability period to minimize total completion time
- Supply chain scheduling problem in the hospital with periodic working time on a single machine
- Single bounded parallel-batch machine scheduling with an unavailability constraint and job delivery
- Approximation algorithms for the single-machine scheduling with a period of maintenance
- Scheduling with cardinality dependent unavailability periods
- Two-stage scheduling on identical machines with assignable delivery times to minimize the maximum delivery completion time
- Coordinated scheduling of the outsourcing, in-house production and distribution operations
- Improved approaches to minimize the makespan on single-machine scheduling with periodic preventive maintenance activities
- The Coordination of Two Parallel Machines Scheduling and Batch Deliveries
- Minimizing total weighted completion time with an unexpected machine unavailable interval
- Single Machine Scheduling with an Availability Constraint and Rejection
- Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness
- Two parallel machines scheduling with two-vehicle job delivery to minimize makespan
- Two-machine flowshop scheduling with intermediate transportation under job physical space consideration
- Two parallel machines problem with job delivery coordination and availability constraint
- Semi-online scheduling on a single machine with unexpected breakdown
- Scheduling with job delivery coordination on single machine
- Machine scheduling with a maintenance interval and job delivery coordination
- Integrated scheduling of production and delivery on a single machine with availability constraint
- Machine scheduling with a maintenance interval and job delivery coordination
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
- Online and semi-online scheduling to minimize makespan on single machine with an availability constraint
- Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval
- Short‐term scheduling with machine calibration
- Single-machine scheduling with machine unavailability periods and resource dependent processing times
- Minimizing total completion time on a single machine with a flexible maintenance activity
- Parallel machine scheduling with job delivery coordination
- Single machine scheduling with job delivery to multiple customers
- Algorithmic Applications in Management
- A new heuristic algorithm for the machine scheduling problem with job delivery coordination
- Minimizing total weighted late work on a single-machine with non-availability intervals
- Preemptive scheduling on identical machines with delivery coordination to minimize the maximum delivery completion time
This page was built for publication: Improved algorithms for two single machine scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860871)
