Bounded single-machine parallel-batch scheduling with release dates and rejection
From MaRDI portal
Publication:1017446
DOI10.1016/j.cor.2008.12.003zbMath1160.90477MaRDI QIDQ1017446
Cheng, T. C. Edwin, Jinjiang Yuan, Ling-Fa Lu, 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
90B35: Deterministic scheduling theory in operations research
Related Items
TWO-MACHINE FLOW SHOP SCHEDULING WITH INDIVIDUAL OPERATION'S REJECTION, A survey on offline scheduling with rejection, A bicriteria approach to scheduling a single machine with job rejection and positional penalties, Scheduling of deteriorating jobs with release dates to minimize the maximum lateness, Single-machine scheduling under the job rejection constraint, Two-machine flow-shop scheduling with rejection, Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs, Minimizing the makespan on a single parallel batching machine, Single-machine scheduling and due date assignment with rejection and position-dependent processing times, Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost
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
