Single machine lot scheduling with optional job-rejection (Q2025088)

scientific article; zbMATH DE number 7347261

Language	Label	Description	Also known as
English	Single machine lot scheduling with optional job-rejection	scientific article; zbMATH DE number 7347261

Statements

instance of

scholarly article

0 references

title

Single machine lot scheduling with optional job-rejection (English)

0 references

0 references

0 references

0 references

Journal of Combinatorial Optimization

0 references

publication date

11 May 2021

0 references

zbMATH Keywords

lot scheduling

0 references

single machine

0 references

order rejection

0 references

dynamic programming

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1007/s10878-020-00651-8

0 references

cites work

Scheduling with job-rejection and position-dependent processing times on proportionate flowshops

0 references

A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization

0 references

Online scheduling with rejection and reordering: exact algorithms for unit size jobs

0 references

Online scheduling of unit jobs on three machines with rejection: a tight result

0 references

Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection

0 references

Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection

0 references

On the parameterized tractability of single machine scheduling with rejection

0 references

Lot scheduling on a single machine

0 references

Parallel-batching scheduling of deteriorating jobs with non-identical sizes and rejection on a single machine

0 references

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''

0 references

Single-machine scheduling with production and rejection costs to minimize the maximum earliness

0 references

Online scheduling to minimize the total weighted completion time plus the rejection cost

0 references

Minmax scheduling problems with common due-date and completion time penalty

0 references

Single-machine lot scheduling with variable lot processing times

0 references

A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection

0 references

Regular scheduling measures on proportionate flowshop with job rejection

0 references

Flowshop scheduling with learning effect and job rejection

0 references

On the minmax common-due-date problem: extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops

0 references

Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow

0 references

Faster algorithms for single machine scheduling with release dates and rejection

0 references

A survey on offline scheduling with rejection

0 references

Single-machine scheduling under the job rejection constraint

0 references

New results on two-machine flow-shop scheduling with rejection

0 references

Approximation algorithms for precedence-constrained identical machine scheduling with rejection

0 references

Single machine lot scheduling to minimize the total weighted (discounted) completion time

0 references

Scheduling with release times and rejection on two parallel machines

0 references

Identifiers

zbMATH Open document ID

1468.90054

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1007/S10878-020-00651-8

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2025088