Bounded single-machine parallel-batch scheduling with release dates and rejection

DOI10.1016/J.COR.2008.12.003MaRDI QIDQ1017446zbMATH OpenOpenAlexFDO

Authors Jinjiang Yuan, Lingfa Lu, T. C. Edwin Cheng, Li-Qi Zhang

Publication date 19 May 2009

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10397/1306

zbMATH Keywords

schedulingpolynomial-time approximation schemerejection penaltyparallel-batch

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Single machine parallel-batch scheduling with release dates and machine availability constraints
• Approximation algorithms for single machine parallel-batch scheduling with release dates subject to the number of rejected jobs not exceeding a given threshold
• Parallel-machine scheduling with release dates and rejection
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
• Improved approximation algorithms for parallel machine scheduling with release dates and job rejection
• The unbounded parallel batch machine scheduling with rejection
• Scheduling a bounded parallel-batching machine with incompatible job families and rejection
• Faster algorithms for single machine scheduling with release dates and rejection
• Parallel-batch scheduling with deterioration and rejection on a single machine
• Improved algorithms for single machine scheduling with release dates and rejections

Cites work

• Minimizing makespan on a single batch processing machine with dynamic job arrivals
• Multiprocessor Scheduling with Rejection
• On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
• Preemptive multiprocessor scheduling with rejection
• Preemptive scheduling with rejection
• Scheduling a batching machine
• Scheduling linear deteriorating jobs with rejection on a single machine
• Scheduling one batch processor subject to job release dates
• Scheduling with machine cost and rejection
• Single machine scheduling with release dates and rejection
• Techniques for scheduling with rejection
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan

Cited in

(39)

• Penalty cost constrained identical parallel machine scheduling problem
• Parallel-batch scheduling with rejection: structural properties and approximation algorithms
• Scheduling a single machine with parallel batching to minimize makespan and total rejection cost
• Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection
• Batch scheduling with proportional-linear deterioration and outsourcing
• A survey on offline scheduling with rejection
• An unbounded batch scheduling with rejections
• Scheduling with partial rejection
• The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
• Single-machine scheduling under the job rejection constraint
• A bicriteria approach to scheduling a single machine with job rejection and positional penalties
• Graph multi-coloring for a job scheduling application
• Scheduling with release times and rejection on two parallel machines
• Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine
• Bounded parallel-batch scheduling on unrelated parallel machines
• An improved heuristic for parallel machine scheduling with rejection
• Two-machine flow-shop scheduling with rejection
• Minmax scheduling and due-window assignment with position-dependent processing times and job rejection
• Bounds for naive multiple machine scheduling with release times and deadlines
• Scheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machines
• Single machine parallel-batch scheduling with release dates and machine availability constraints
• TWO-MACHINE FLOW SHOP SCHEDULING WITH INDIVIDUAL OPERATION'S REJECTION
• Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow
• Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost
• Approximation algorithms for single machine parallel-batch scheduling with release dates subject to the number of rejected jobs not exceeding a given threshold
• Scheduling a bounded parallel-batching machine with incompatible job families and rejection
• Minimizing the makespan on a single parallel batching machine
• Parallel-batch scheduling with deterioration and rejection on a single machine
• Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs
• Single-machine scheduling with production and rejection costs to minimize the maximum earliness
• Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions
• Two-agent scheduling with rejection on a single machine
• Single-machine scheduling and due date assignment with rejection and position-dependent processing times
• Scheduling of deteriorating jobs with release dates to minimize the maximum lateness
• Order acceptance and scheduling with consideration of service level
• Parallel machine scheduling with restricted job rejection
• The unbounded parallel batch machine scheduling with rejection
• Order acceptance and scheduling with machine availability constraints
• Scheduling with job-rejection and position-dependent processing times on proportionate flowshops

This page was built for publication: Bounded single-machine parallel-batch scheduling with release dates and rejection

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