Abstract
We consider m machines in parallel with each machine capable of producing one specific product type. There are n orders with each one requesting specific quantities of the various different product types. Order j has a release date r j and a due date d j . The different product types for order j can be produced at the same time. We consider various due date related objectives such as the minimization of the maximum lateness L max and the total number of late orders ∑ U j . We present polynomial time algorithms for the easy cases and heuristics for NP-hard cases. For minimizing ∑ U j , we also propose an exact algorithm based on Constraint Propagation and bounding strategy. The effectiveness of the algorithms is demonstrated through an empirical study.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.