Abstract
AbstractInspired by the concept of generalized due dates introduced by Hall (IIE Transactions, 18(2), 220–222), in this article we first define four new generalized parameters in machine scheduling: the generalized release dates (GRD), generalized processing times (GPT), generalized rejection costs (GRC), and generalized delivery times (GDT). We then study order acceptance and scheduling problems with delivery consideration under the generalized parameters of GRD, GPT, GRC, and GDT, respectively. The objective of each scheduling problem in consideration is to minimize the maximum delivery completion time of the accepted jobs plus the total rejection penalty cost of the rejected jobs. We show that two of the six problems studied in this article are weakly NP‐hard while the other four ones can be solved in polynomial time. For each NP‐hard problem, we provide a pseudo‐polynomial time algorithm, a 2‐approximation algorithm and a fully polynomial‐time approximation scheme.
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.
