Single machine lot scheduling with optional job-rejection
From MaRDI portal
Publication:2025088
DOI10.1007/s10878-020-00651-8zbMath1468.90054OpenAlexW3092390214MaRDI QIDQ2025088
Dana Shapira, Gur Mosheiov, Baruch Mor
Publication date: 11 May 2021
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-020-00651-8
Related Items (7)
A survey of job shop scheduling problem: the types and models ⋮ A greedy heuristic for solving scheduling problems with bounded rejection cost ⋮ Single machine scheduling with non-availability interval and optional job rejection ⋮ A note on lot scheduling on a single machine to minimize maximum weighted tardiness ⋮ Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection ⋮ A note on the single machine CON and CONW problems with lot scheduling ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
Cites Work
- Faster algorithms for single machine scheduling with release dates and rejection
- New results on two-machine flow-shop scheduling with rejection
- A survey on offline scheduling with rejection
- Lot scheduling on a single machine
- Online scheduling with rejection and reordering: exact algorithms for unit size jobs
- Scheduling with job-rejection and position-dependent processing times on proportionate flowshops
- Online scheduling of unit jobs on three machines with rejection: a tight result
- Single-machine scheduling under the job rejection constraint
- A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
- Single machine lot scheduling to minimize the total weighted (discounted) completion time
- Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection
- Approximation algorithms for precedence-constrained identical machine scheduling with rejection
- Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection
- A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection
- On the parameterized tractability of single machine scheduling with rejection
- Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine
- Flowshop scheduling with learning effect and job rejection
- Regular scheduling measures on proportionate flowshop with job rejection
- Scheduling with release times and rejection on two parallel machines
- Single-machine scheduling with production and rejection costs to minimize the maximum earliness
- Online scheduling to minimize the total weighted completion time plus the rejection cost
- Comments on ``Proportionate flowshops with general position dependent processing times and ``Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection
- Minmax scheduling problems with common due-date and completion time penalty
- Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow
- Single-machine lot scheduling with variable lot processing times
- On the minmax common-due-date problem: extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops
This page was built for publication: Single machine lot scheduling with optional job-rejection
