Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling (Q2009683): Difference between revisions

Latest revision as of 18:27, 16 December 2024

scientific article

Language	Label	Description	Also known as
English	Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling	scientific article

Statements

instance of

scholarly article

0 references

title

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

0 references

author

Seyed Reza Hejazi

0 references

Morteza Rasti Barzoki

0 references

published in

Applied Mathematical Modelling

0 references

publication date

29 November 2019

0 references

zbMATH Keywords

controllable processing time and resource allocation

0 references

distribution

0 references

due date assignment

0 references

supply chain scheduling

0 references

tardy job

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.apm.2014.11.031

0 references

cites work

A new heuristic algorithm for the machine scheduling problem with job delivery coordination

0 references

Optimal due date assignment and resource allocation in a group technology scheduling environment

0 references

Scheduling with common due date, earliness and tardiness penalties for multimachine problems: a survey

0 references

Just-in-time scheduling. Models and algorithms for computer and manufacturing systems

0 references

A survey of the state-of-the-art of common due date assignment and scheduling research

0 references

Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains

0 references

Survey of scheduling research involving due date determination decisions

0 references

Pre-emptive scheduling problems with controllable processing times

0 references

A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates

0 references

Coordinated supply chain management

0 references

Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries

0 references

Single-machine batch scheduling minimizing weighted flow times and delivery costs

0 references

Integrated Production and Outbound Distribution Scheduling: Review and Extensions

0 references

Supply Chain Scheduling: Batching and Delivery

0 references

Manufacturing lead-time rules: customer retention versus tardiness costs

0 references

Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains

0 references

Scheduling with batching: Minimizing the weighted number of tardy jobs

0 references

A survey of scheduling problems with setup times or costs

0 references

Reducibility among Combinatorial Problems

0 references

Q4873242

0 references

A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs

0 references

Single machine scheduling with discretely controllable processing times

0 references

Effects of imperfect products on lot sizing with work in process inventory

0 references

Identifiers

zbMATH Open document ID

1443.90168

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

10.1016/J.APM.2014.11.031

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2009683

@@ Property / DOI @@
-.1016/j.apm.2014.11.031
@@ Property / DOI: 10.1016/j.apm.2014.11.031 / rank @@
-Normal rank
@@ Property / DOI @@
+.1016/J.APM.2014.11.031
@@ Property / DOI: 10.1016/J.APM.2014.11.031 / rank @@
+Normal rank