Due-Window Assignment for a Single Machine Scheduling with Both Deterioration and Positional Effects (Q5265454)

From MaRDI portal

Revision as of 12:02, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article; zbMATH DE number 6466698

Language	Label	Description	Also known as
English	Due-Window Assignment for a Single Machine Scheduling with Both Deterioration and Positional Effects	scientific article; zbMATH DE number 6466698

Statements

scholarly article

0 references

Due-Window Assignment for a Single Machine Scheduling with Both Deterioration and Positional Effects (English)

0 references

Asia-Pacific Journal of Operational Research

0 references

publication date

28 July 2015

0 references

zbMATH Keywords

machine scheduling

0 references

polynomial solution

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

Single Machine Scheduling with Flow Allowances

0 references

Scheduling with time dependent processing times: Review and extensions

0 references

Minimizing the total weighted completion time of deteriorating jobs

0 references

Scheduling jobs with position-dependent processing times

0 references

Multiprocessor Scheduling with Rejection

0 references

Single-machine scheduling with learning considerations

0 references

A state-of-the-art review on scheduling with learning effects

0 references

Due-date assignment and single machine scheduling with deteriorating jobs

0 references

A concise survey of scheduling with time-dependent processing times

0 references

Single machine due-date scheduling of jobs with decreasing start-time dependent processing times

0 references

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

0 references

The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan

0 references

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

0 references

Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine

0 references

Simple matching vs linear assignment in scheduling models with positional effects: a critical review

0 references

A bicriteria approach to scheduling a single machine with job rejection and positional penalties

0 references

A note on scheduling problems with learning effect and deteriorating jobs

0 references

Single machine multiple common due dates scheduling with learning effects

0 references

A due-date assignment problem with learning effect and deteriorating jobs

0 references

Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects

0 references

Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan

0 references

Single-machine scheduling with both deterioration and learning effects

0 references

Single machine scheduling with sum-of-logarithm-processing-times based deterioration

0 references

Single machine scheduling with release dates and rejection

0 references

full work available at URL

https://doi.org/10.1142/s0217595915500141

0 references

Identifiers

zbMATH Open document ID

0 references

10.1142/S0217595915500141

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5265454

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