Abstract
This paper studies a production scheduling problem in a multinational company in Hong Kong, the headquarters, sales branches and factories of which are located in different countries and regions. Some orders are required to go for processing in a particular factory. Based on a Just-In-Time (JIT) strategy, an objective function is defined for the production scheduling problem with a due window. A series of Lemmas and a polynomial-time algorithm are presented to determine the optimal due window and sequence. The algorithm is tested on data collected from the company. Computational results demonstrate the effectiveness of the algorithm.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
