Pages that link to "Item:Q841595"

The following pages link to Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval (Q841595):

Displaying 21 items.

• A branch-and-bound method for the single-machine scheduling problem under a non-availability constraint for maximum delivery time minimization (Q298761) (← links)
• Semi-online scheduling on a single machine with unexpected breakdown (Q306274) (← links)
• Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval (Q326506) (← links)
• Integrated scheduling of production and delivery on a single machine with availability constraint (Q476906) (← links)
• Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date (Q708332) (← links)
• Supply chain scheduling problem in the hospital with periodic working time on a single machine (Q887873) (← links)
• A note on ``scheduling of nonresumable jobs and flexible maintenance activities on a single machine to minimize makespan'' (Q1015007) (← links)
• Approximation algorithms for single machine scheduling with one unavailability period (Q1022445) (← links)
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
• Minimizing total weighted late work on a single-machine with non-availability intervals (Q2165284) (← links)
• An improved semi-online algorithm for scheduling on a single machine with unexpected breakdown (Q2185825) (← links)
• Single-machine scheduling with machine unavailability periods and resource dependent processing times (Q2242291) (← links)
• Order acceptance and scheduling with machine availability constraints (Q2255964) (← links)
• Online scheduling on two parallel machines with release dates and delivery times (Q2355989) (← links)
• Scheduling jobs and maintenance activities on parallel machines (Q2359536) (← links)
• Equivalence of some different maintenance activities in single-machine scheduling (Q2422132) (← links)
• Online and semi-online scheduling to minimize makespan on single machine with an availability constraint (Q3451058) (← links)
• A Survey on Approximation Algorithms for Scheduling with Machine Unavailability (Q3637311) (← links)
• Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines (Q4578168) (← links)
• Two-agent single-machine scheduling with release dates to minimize the makespan (Q6081603) (← links)
• Single machine scheduling with rejection and a non-availability interval to minimize the maximum delivery completion time plus the total rejection cost (Q6542992) (← links)