Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling

DOI10.1016/J.APM.2014.11.031zbMath1443.90168OpenAlexW1977044406MaRDI QIDQ2009683

Seyed Reza Hejazi, Morteza Rasti Barzoki

Publication date: 29 November 2019

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2014.11.031

zbMATH Keywords

distributionsupply chain schedulingdue date assignmenttardy jobcontrollable processing time and resource allocation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)

Related Items (5)

Scheduling unrelated parallel machine problem with multi-mode processing times and batch delivery cost ⋮ Polynomially solvable subcases for the approximate solution of multi-machine scheduling problems ⋮ A metric approach for scheduling problems with minimizing the maximum penalty ⋮ Decision model for the customer order decoupling point considering order insertion scheduling with capacity and time constraints in logistics service supply chain ⋮ SINGLE MACHINE DUE DATE ASSIGNMENT SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS AND CONTROLLABLE PROCESSING TIMES IN FUZZY ENVIRONMENT

Cites Work

• Unnamed Item
• Effects of imperfect products on lot sizing with work in process inventory
• Single-machine batch scheduling minimizing weighted flow times and delivery costs
• Manufacturing lead-time rules: customer retention versus tardiness costs
• Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
• Pre-emptive scheduling problems with controllable processing times
• Optimal due date assignment and resource allocation in a group technology scheduling environment
• A new heuristic algorithm for the machine scheduling problem with job delivery coordination
• Survey of scheduling research involving due date determination decisions
• Coordinated supply chain management
• Scheduling with batching: Minimizing the weighted number of tardy jobs
• Single machine scheduling with discretely controllable processing times
• A survey of the state-of-the-art of common due date assignment and scheduling research
• A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs
• Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey
• Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains
• Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains
• A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
• A survey of scheduling problems with setup times or costs
• Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
• Integrated Production and Outbound Distribution Scheduling: Review and Extensions
• Supply Chain Scheduling: Batching and Delivery
• Reducibility among Combinatorial Problems

This page was built for publication: Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling