Pages that link to "Item:Q398830"

The following pages link to A survey on offline scheduling with rejection (Q398830):

Displaying 50 items.

• Improved algorithms for single machine scheduling with release dates and rejections (Q262445) (← links)
• Scheduling a single machine with parallel batching to minimize makespan and total rejection cost (Q266826) (← links)
• Two-machine open-shop scheduling with rejection to minimize the makespan (Q280183) (← links)
• Faster algorithms for single machine scheduling with release dates and rejection (Q280934) (← links)
• New results on two-machine flow-shop scheduling with rejection (Q281786) (← links)
• Parallel-machine scheduling with release dates and rejection (Q295880) (← links)
• The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost (Q297182) (← links)
• Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs (Q298499) (← links)
• An analysis of the non-preemptive mixed-criticality match-up scheduling problem (Q341470) (← links)
• Serial batch scheduling on uniform parallel machines to minimize total completion time (Q402366) (← links)
• Scheduling a bounded parallel-batching machine with incompatible job families and rejection (Q489155) (← links)
• Supply chain scheduling to minimize holding costs with outsourcing (Q490179) (← links)
• The prize-collecting scheduling problem with deadlines (Q510929) (← 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)
• Improved approximation algorithms for parallel machine scheduling with release dates and job rejection (Q681293) (← links)
• An approximation algorithm for \(k\)-facility location problem with linear penalties using local search scheme (Q724755) (← links)
• Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem (Q725705) (← links)
• In-house production and outsourcing under different discount schemes on the total outsourcing cost (Q829187) (← links)
• New approximation algorithms for machine scheduling with rejection on single and parallel machine (Q830930) (← links)
• Minimizing maximum delivery completion time for order scheduling with rejection (Q830938) (← links)
• Penalty cost constrained identical parallel machine scheduling problem (Q897945) (← links)
• Scheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machines (Q906399) (← links)
• A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization (Q1628126) (← links)
• Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695) (← links)
• A multi-objective evolutionary algorithm guided by directed search for dynamic scheduling (Q1652172) (← links)
• Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection (Q1652303) (← links)
• Two-agent parallel-machine scheduling with rejection (Q1676363) (← links)
• Bicriteria order acceptance and scheduling with consideration of fill rate (Q1683125) (← links)
• Scheduling problems with rejection to minimize the maximum flow time (Q1691942) (← links)
• Approximation algorithms for precedence-constrained identical machine scheduling with rejection (Q1698078) (← links)
• Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection (Q1705653) (← links)
• Scheduling simple linear deteriorating jobs with rejection (Q1717817) (← links)
• Multiobjective order acceptance and scheduling on unrelated parallel machines with machine eligibility constraints (Q1721157) (← links)
• Exact methods for order acceptance and scheduling on unrelated parallel machines (Q1725610) (← links)
• A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection (Q1730596) (← links)
• Vector scheduling with rejection on a single machine (Q1743644) (← links)
• A constraint generation approach for two-machine shop problems with jobs selection (Q1751902) (← links)
• Match-up scheduling of mixed-criticality jobs: maximizing the probability of jobs execution (Q1754012) (← links)
• On the parameterized tractability of single machine scheduling with rejection (Q1991260) (← links)
• A single-machine scheduling problem with uncertainty in processing times and outsourcing costs (Q1992893) (← links)
• Multipurpose machine scheduling with rejection and identical job processing times (Q2018939) (← links)
• Single machine lot scheduling with optional job-rejection (Q2025088) (← links)
• Minmax scheduling and due-window assignment with position-dependent processing times and job rejection (Q2026708) (← links)
• Minimizing total late work on a single machine with generalized due-dates (Q2030324) (← links)
• New results for scheduling to minimize tardiness on one machine with rejection and related problems (Q2061129) (← links)
• Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates (Q2066679) (← links)
• Parallel-machine scheduling in shared manufacturing (Q2076469) (← links)
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
• Two-machine flow shop scheduling with a common due date to maximize total early work (Q2116855) (← links)