Pages that link to "Item:Q5898864"

The following pages link to Theory and Applications of Models of Computation (Q5898864):

Displaying 18 items.

• A survey on offline scheduling with rejection (Q398830) (← links)
• A bicriteria approach to scheduling a single machine with job rejection and positional penalties (Q437059) (← links)
• Order acceptance and scheduling with consideration of service level (Q513576) (← links)
• Scheduling with job-rejection and position-dependent processing times on proportionate flowshops (Q523188) (← links)
• New approximation algorithms for machine scheduling with rejection on single and parallel machine (Q830930) (← links)
• Single-machine scheduling under the job rejection constraint (Q964407) (← links)
• A PTAS for parallel batch scheduling with rejection and dynamic job arrivals (Q1029345) (← links)
• Two-machine flow-shop scheduling with rejection (Q1762086) (← links)
• Multipurpose machine scheduling with rejection and identical job processing times (Q2018939) (← links)
• Minmax scheduling and due-window assignment with position-dependent processing times and job rejection (Q2026708) (← links)
• Minsum scheduling with acceptable lead-times and optional job rejection (Q2119760) (← links)
• Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times (Q2124913) (← links)
• A general scheme for solving a large set of scheduling problems with rejection in FPT time (Q2142679) (← links)
• A greedy heuristic for solving scheduling problems with bounded rejection cost (Q2147117) (← links)
• Inverse interval scheduling via reduction on a single machine (Q2158006) (← links)
• Single-machine scheduling with maintenance activities and rejection (Q2218650) (← links)
• Minimizing the makespan on a single parallel batching machine (Q2268874) (← links)
• Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost (Q2444843) (← links)