Abstract
The parameter setting problems are to modify the initial parameters of a system optimally such that some pre-specific objective of the system can be reached. The principle behind parameter setting could be regarded as a target-first philosophy. The parameter setting problems can be found applications in the many real production systems, particularly in the emergency situation. In this paper, we consider the parameter setting problems for some classical single machine scheduling problems. We present O(n 2) algorithms for the processing-time setting problem of 1||∑C i , the processing-time setting problem of 1||T max, the processingtime setting problem of 1|r i |C max, and the release time setting problem of 1|ri|C max with fixed lower bounds and fixed unit cost, respectively. We also show that the due-time setting problem of 1||T max is NP-hard.
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 callMore From: International Journal of Management Science and Engineering Management
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.
