Scheduling and due-date assignment problems with job rejection

zbMATH Open1204.90046MaRDI QIDQ3070928FDOQ3070928

Authors: Assaf Sarig, Gur Mosheiov 

Publication date: 28 January 2011

Recommendations

• Scheduling a single machine with job rejection and due-window assignment
• Single-machine scheduling under the job rejection constraint
• Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection
• A survey on offline scheduling with rejection
• Minmax scheduling and due-window assignment with position-dependent processing times and job rejection

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)

Cited In (12)

• A survey on offline scheduling with rejection
• Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection
• A survey on job scheduling with rejection
• Scheduling problems with rejection to minimize the maximum flow time
• Minsum scheduling with acceptable lead-times and optional job rejection
• Scheduling on parallel identical machines with job-rejection and position-dependent processing times
• Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection
• Title not available (Why is that?)
• Minmax scheduling problems with common due-date and completion time penalty
• An Optimal Incremental Algorithm for Minimizing Lateness with Rejection
• Scheduling a single machine with job rejection and due-window assignment
• Scheduling Unit Jobs with a Common Deadline to Minimize the Sum of Weighted Completion Times and Rejection Penalties

This page was built for publication: Scheduling and due-date assignment problems with job rejection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3070928)