Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling
From MaRDI portal
(Redirected from Publication:2009683)
Recommendations
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains
- Integrated production and distribution scheduling in supply chain management
- Integrated production and distribution scheduling with committed delivery dates
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
- Supply chain scheduling with parallel machines
Cites work
- A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates
- A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs
- A new heuristic algorithm for the machine scheduling problem with job delivery coordination
- A survey of scheduling problems with setup times or costs
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains
- Coordinated supply chain management
- Effects of imperfect products on lot sizing with work in process inventory
- scientific article; zbMATH DE number 866105 (Why is no real title available?)
- Integrated Production and Outbound Distribution Scheduling: Review and Extensions
- Just-in-time scheduling. Models and algorithms for computer and manufacturing systems
- Manufacturing lead-time rules: customer retention versus tardiness costs
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains
- Optimal due date assignment and resource allocation in a group technology scheduling environment
- Pre-emptive scheduling problems with controllable processing times
- Reducibility among combinatorial problems
- Scheduling with batching: Minimizing the weighted number of tardy jobs
- Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey
- Single machine scheduling with discretely controllable processing times
- Single-machine batch scheduling minimizing weighted flow times and delivery costs
- Supply Chain Scheduling: Batching and Delivery
- Survey of scheduling research involving due date determination decisions
Cited in
(6)- 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
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains
- Single machine due date assignment scheduling problem with precedence constraints and controllable processing times in fuzzy environment
- 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
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2009683)
