A Sequencing Problem with Release Dates and Clustered Jobs

DOI10.1287/MNSC.32.6.731MaRDI QIDQ3731355zbMATH OpenOpenAlexFDO

Authors Marc E. Posner

Publication date 1986

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.32.6.731

zbMATH Keywords

heuristicrelease datespolynomial time algorithmsum of weighted completion timesclustered jobsone-machine scheduling problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Recommendations

• Scheduling of a single machine to minimize total weighted completion time subject to release dates
• Technical Note—Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times
• Scheduling with release dates on a single machine to minimize total weighted completion time
• Formulating the single machine sequencing problem with release dates as a mixed integer program
• scientific article; zbMATH DE number 3850790

Cited in

(4)

• Heuristic methods and applications: A categorized survey
• Formulating the single machine sequencing problem with release dates as a mixed integer program
• The power of \(\alpha\)-points in preemptive single machine scheduling.
• A supermodular relaxation for scheduling with release dates

This page was built for publication: A Sequencing Problem with Release Dates and Clustered Jobs

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