Parallel machine scheduling with common due windows

DOI10.1057/JORS.2008.184MaRDI QIDQ4929846zbMATH OpenOpenAlexFDO

Authors

Publication date 24 September 2010

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.2008.184

zbMATH Keywords

due windowson-timeoperation schedulingparallel machine

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Parallel machine scheduling with a common due window
• Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs
• Due window scheduling for parallel machines
• Just-in-time scheduling with equal-size jobs
• Parallel Processing and Applied Mathematics

Cited in

(7)

• Due-window assignment with identical jobs on parallel uniform machines
• Parallel machine scheduling and common due window assignment with job independent earliness and tardiness costs
• A survey on scheduling problems with due windows
• Multi-objective two-stage multiprocessor flow shop scheduling – a subgroup particle swarm optimisation approach
• scientific article; zbMATH DE number 4059106 (Why is no real title available?)
• Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times
• Clarifying cutting and sewing processes with due windows using an effective ant colony optimization

This page was built for publication: Parallel machine scheduling with common due windows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4929846)