Pages that link to "Item:Q4943705"

The following pages link to Multiprocessor Scheduling with Rejection (Q4943705):

Displaying 50 items.

• Two-machine open-shop scheduling with rejection to minimize the makespan (Q280183) (← links)
• New results on two-machine flow-shop scheduling with rejection (Q281786) (← links)
• Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines (Q290334) (← links)
• Parallel-machine scheduling with release dates and rejection (Q295880) (← links)
• Min-max regret version of a scheduling problem with outsourcing decisions under processing time uncertainty (Q322893) (← links)
• Semi-online scheduling on two identical machines with rejection (Q385491) (← links)
• A survey on offline scheduling with rejection (Q398830) (← links)
• Preemptive online scheduling with rejection of unit jobs on two uniformly related machines (Q398903) (← links)
• Optimal semi-online algorithm for scheduling with rejection on two uniform machines (Q411229) (← links)
• Two-machine flow shop scheduling problem with an outsourcing option (Q421578) (← links)
• Scheduling on parallel identical machines with job-rejection and position-dependent processing times (Q456108) (← links)
• Scheduling a bounded parallel-batching machine with incompatible job families and rejection (Q489155) (← links)
• Online scheduling with rejection and reordering: exact algorithms for unit size jobs (Q489737) (← links)
• Order acceptance and scheduling with consideration of service level (Q513576) (← links)
• Approximation algorithms for supply chain planning and logistics problems with market choice (Q647392) (← links)
• Online scheduling with rejection and withdrawal (Q650898) (← 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)
• Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines (Q817020) (← 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)
• Bin packing with rejection revisited (Q848845) (← links)
• On-line scheduling with rejection on identical parallel machines (Q882532) (← links)
• Penalty cost constrained identical parallel machine scheduling problem (Q897945) (← links)
• Online scheduling of unit jobs on three machines with rejection: a tight result (Q903197) (← links)
• Scheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machines (Q906399) (← links)
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan (Q924160) (← links)
• Online unit clustering: Variations on a theme (Q954982) (← links)
• Single-machine scheduling under the job rejection constraint (Q964407) (← links)
• On maximizing the profit of a satellite launcher: selecting and scheduling tasks with time windows and setups (Q967435) (← links)
• Bounded single-machine parallel-batch scheduling with release dates and rejection (Q1017446) (← links)
• Online scheduling in a parallel batch processing system to minimize makespan using restarts (Q1022602) (← links)
• A PTAS for parallel batch scheduling with rejection and dynamic job arrivals (Q1029345) (← links)
• On-line scheduling of unit time jobs with rejection on uniform machines (Q1031971) (← links)
• Single machine scheduling with release dates and rejection (Q1042081) (← links)
• A manifesto for the computational method (Q1603721) (← 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)
• Scheduling simple linear deteriorating jobs with rejection (Q1717817) (← links)
• Exact methods for order acceptance and scheduling on unrelated parallel machines (Q1725610) (← links)
• Vector scheduling with rejection on a single machine (Q1743644) (← links)
• On-line scheduling of unit time jobs with rejection: Minimizing the total completion time (Q1870022) (← links)
• An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines (Q1926814) (← links)
• Batch scheduling with proportional-linear deterioration and outsourcing (Q1992948) (← links)
• Applying ``peeling onion'' approach for competitive analysis in online scheduling with rejection (Q2029304) (← links)
• Approximation algorithms for the multiprocessor scheduling with submodular penalties (Q2047204) (← links)
• Single machine scheduling with rejection and generalized parameters (Q2149874) (← links)