Minmax scheduling problems with common due-date and completion time penalty (Q2424794): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 22:07, 17 August 2024

scientific article

Language	Label	Description	Also known as
English	Minmax scheduling problems with common due-date and completion time penalty	scientific article

Statements

scholarly article

0 references

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

0 references

zbMATH Open document ID

0 references

10.1007/s10878-018-0365-8

0 references

0 references

Journal of Combinatorial Optimization

0 references

publication date

25 June 2019

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

scheduling

0 references

single machine

0 references

common due-date

0 references

minmax

0 references

position-dependent processing times

0 references

job-rejection

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10878-018-0365-8

0 references

0 references

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

0 references

Multiagent Scheduling

0 references

Sequencing with Earliness and Tardiness Penalties: A Review

0 references

Single-machine scheduling with learning considerations

0 references

Multiple-machine scheduling with earliness, tardiness and completion time penalties

0 references

Single machine scheduling with precedence constraints and positionally dependent processing times

0 references

Scheduling on parallel identical machines with job-rejection and position-dependent processing times

0 references

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

0 references

Single machine scheduling and due date assignment with positionally dependent processing times

0 references

A survey of the state-of-the-art of common due date assignment and scheduling research

0 references

A survey on scheduling problems with due windows

0 references

Common due window size and location determination in a single machine scheduling problem

0 references

Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation

0 references

Scheduling a deteriorating maintenance activity and due-window assignment

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

Proportionate flowshops with general position-dependent processing times

0 references

A due-window assignment problem with position-dependent processing times

0 references

Minmax scheduling problems with a common due-window

0 references

Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem

0 references

The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost

0 references

A survey on offline scheduling with rejection

0 references

Single-machine scheduling with precedence constraints and position-dependent processing times

0 references

Single-machine scheduling with piece-rate maintenance and interval constrained position-dependent processing times

0 references

Single machine group scheduling with position dependent processing times and ready times

0 references

Scheduling with release times and rejection on two parallel machines

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2424794

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2424794&oldid=37600543"