Pages that link to "Item:Q3863414"
From MaRDI portal
The following pages link to PERFORMANCE ANALYSIS OF SIX APPROXIMATION ALGORITHMS FOR THE ONE-MACHINE MAXIMUM LATENESS SCHEDULING PROBLEM WITH READY TIMES (Q3863414):
Displayed 22 items.
- Optimal algorithms for online single machine scheduling with deteriorating jobs (Q442286) (← links)
- Approximation algorithms for no idle time scheduling on a single machine with release times and delivery times (Q496647) (← links)
- Notes on ``Some single-machine scheduling problems with general position-dependent and time-dependent learning effects'' (Q545340) (← links)
- Single-machine scheduling problems with time and position dependent processing times (Q646660) (← links)
- Patients scheduling problems with deferred deteriorated functions (Q887895) (← links)
- Jackson's semi-preemptive scheduling on a single machine (Q991363) (← links)
- On-line scheduling with delivery time on a single batch machine (Q1022586) (← links)
- An optimal online algorithm for single machine scheduling with bounded delivery times (Q1038322) (← links)
- Approximability of flow shop scheduling (Q1290640) (← links)
- An approximation algorithm for a single-machine scheduling problem with release times and delivery times (Q1314328) (← links)
- Domination analysis of combinatorial optimization problems. (Q1406045) (← links)
- Parallel machine scheduling with nested processing set restrictions and job delivery times (Q1792963) (← links)
- Approximation schemes for minimizing the maximum lateness on a single machine with release times under non-availability or deadline constraints (Q1799225) (← links)
- A sequencing problem with family setup times (Q1917311) (← links)
- An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown (Q2185825) (← links)
- Scheduling a single machine with primary and secondary objectives (Q2331605) (← links)
- Single machine and flowshop scheduling problems with sum-of-processing time based learning phenomenon (Q2338473) (← links)
- Heuristics for minimizing maximum lateness on a single machine with family-dependent set-up times (Q2462548) (← links)
- A best on-line algorithm for single machine scheduling with small delivery times (Q2481972) (← links)
- A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times (Q2668670) (← links)
- Optimal on-line algorithms for single-machine scheduling (Q4645938) (← links)
- Scheduling Algorithms for Single Machine Problem with Release and Delivery Times (Q6110178) (← links)