On single machine scheduling and due dateassignment with positionally dependent processing times

DOI10.1007/978-3-642-00142-0_20zbMATH Open1209.90167OpenAlexW4249592994MaRDI QIDQ5392001FDOQ5392001

V. A. Strusevich, V. S. Gordon

Publication date: 7 April 2011

Published in: Operations Research Proceedings 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00142-0_20

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited In (7)

• Single machine scheduling with a variable common due date and resource-dependent processing times.
• Fabrication scheduling on a single machine with due date constraints
• Single machine due-date scheduling of jobs with decreasing start-time dependent processing times
• Two due date assignment problems in scheduling a single machine
• Dominance rules for single machine schedule with sequence dependent setup and due date
• Optimal due-date assignment for a single machine sequencing problem with random processing times
• Single-machine scheduling problems with time and position dependent processing times

   Recommendations

• Single machine scheduling and due date assignment with positionally dependent processing times 👍 👎
• Schedules with due-date assignment and position-dependent processing times 👍 👎
• A due-date assignment problem with learning effect and deteriorating jobs 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: On single machine scheduling and due dateassignment with positionally dependent processing times

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