Bounded single-machine parallel-batch scheduling with release dates and rejection
From MaRDI portal
Publication:1017446
DOI10.1016/j.cor.2008.12.003zbMath1160.90477OpenAlexW2047239908MaRDI QIDQ1017446
Jinjiang Yuan, Li-Qi Zhang, Ling-Fa Lu, Cheng, T. C. Edwin
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
Related Items (31)
Scheduling a single machine with parallel batching to minimize makespan and total rejection cost ⋮ Scheduling with release times and rejection on two parallel machines ⋮ An improved heuristic for parallel machine scheduling with rejection ⋮ Parallel machine scheduling with restricted job rejection ⋮ Scheduling with partial rejection ⋮ Single-machine scheduling with production and rejection costs to minimize the maximum earliness ⋮ Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine ⋮ A survey on offline scheduling with rejection ⋮ Graph multi-coloring for a job scheduling application ⋮ Parallel-batch scheduling with rejection: structural properties and approximation algorithms ⋮ Penalty cost constrained identical parallel machine scheduling problem ⋮ Parallel-batch scheduling with deterioration and rejection on a single machine ⋮ Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions ⋮ Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs ⋮ Scheduling with job rejection and nonsimultaneous machine available time on unrelated parallel machines ⋮ A bicriteria approach to scheduling a single machine with job rejection and positional penalties ⋮ Single-machine scheduling and due date assignment with rejection and position-dependent processing times ⋮ Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection ⋮ Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost ⋮ Scheduling a bounded parallel-batching machine with incompatible job families and rejection ⋮ Order acceptance and scheduling with consideration of service level ⋮ Batch scheduling with proportional-linear deterioration and outsourcing ⋮ TWO-MACHINE FLOW SHOP SCHEDULING WITH INDIVIDUAL OPERATION'S REJECTION ⋮ Scheduling with job-rejection and position-dependent processing times on proportionate flowshops ⋮ Scheduling of deteriorating jobs with release dates to minimize the maximum lateness ⋮ Single-machine scheduling under the job rejection constraint ⋮ Order acceptance and scheduling with machine availability constraints ⋮ Two-machine flow-shop scheduling with rejection ⋮ Minimizing the makespan on a single parallel batching machine ⋮ Minmax scheduling and due-window assignment with position-dependent processing times and job rejection ⋮ Two-agent scheduling with rejection on a single machine
Cites Work
- The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan
- Scheduling linear deteriorating jobs with rejection on a single machine
- Single machine scheduling with release dates and rejection
- Scheduling a batching machine
- Preemptive scheduling with rejection
- Scheduling one batch processor subject to job release dates
- On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
- Scheduling with machine cost and rejection
- Minimizing makespan on a single batch processing machine with dynamic job arrivals
- Techniques for scheduling with rejection
- Multiprocessor Scheduling with Rejection
- Preemptive multiprocessor scheduling with rejection
This page was built for publication: Bounded single-machine parallel-batch scheduling with release dates and rejection
