Abstract

In this study, we introduce a mixed nonlinear integer programming formulation for parallel machine earliness/tardiness (ET) scheduling with simultaneous effects of learning and linear deterioration, sequence-dependent setups, and a common due-date for all jobs. By the effects of learning and linear deterioration, we propose that the processing time of a job is defined by increasing function of its execution start time and position in the sequence. The developed model allows sequence-dependent setups and sequence-dependent early/tardy penalties. The model can easily provide the optimal solution to problems involving about eleven jobs and two machines.

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 call

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.