Group sequencing around a common due date

DOI10.1016/J.DISOPT.2006.04.003MaRDI QIDQ937402zbMATH OpenOpenAlexFDO

Authors B. E. Eshmatov

Publication date 15 August 2008

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/10397/1263

zbMATH Keywords

dynamic programmingearliness-tardinessgroup technologysingle machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Recommendations

• Single machine scheduling with common due data assignment in a group technology environment
• Batch scheduling and common due-date assignment on a single machine
• Optimal due date assignment and resource allocation in a group technology scheduling environment
• Scheduling to minimize weighted earliness and tardiness about a common due-date
• Single-machine scheduling to minimize earliness and number of tardy jobs

Cites work

• A survey of the state-of-the-art of common due date assignment and scheduling research
• Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• Group scheduling with controllable setup and processing times: minimizing total weighted completion time
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 778418 (Why is no real title available?)
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Minimizing the number of late jobs under the group technology assumption
• Scheduling with batching: A review
• Sequencing with Earliness and Tardiness Penalties: A Review
• Sequencing with ordered criteria, precedence and group technology constraints
• Single machine group scheduling with ordered criteria
• Single machine group scheduling with resource dependent setup and processing times
• The complexity of scheduling job families about a common due date

Cited in

(5)

• Minimizing the number of late jobs under the group technology assumption
• Single machine scheduling with common due data assignment in a group technology environment
• A Group-Dependent Due Window Assignment Scheduling Problem with Controllable Learning Effect
• A hybrid heuristic approach to minimize number of tardy jobs in group technology systems
• Optimal due date assignment and resource allocation in a group technology scheduling environment

This page was built for publication: Group sequencing around a common due date

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