Publisher
Springer Science and Business Media LLC
Subject
Electrical and Electronic Engineering,Control and Optimization,Computer Networks and Communications,Computer Science Applications,Modeling and Simulation,Control and Systems Engineering
Reference23 articles.
1. BaggaP.C., and KalraK.R. 1980. A Node Elimination Procedure for Towsend's Algorithm for Solving the Single Machine Quadratic Penalty Function Scheduling Problem. Manag. Science, 26, (6): 633?636.
2. ConwayR.W., MaxwellW.L., and MillerL.W. 1967. Theory of scheduling. Reading, MA: Addison-Wesley.
3. CoffmanE.G.Jr. 1976. Computer and Job-Shop Scheduling Theory. New York: Wiley and Sons.
4. GareyM.R., and JohnsonD.S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman.
5. GuptaS.K., and SenT. 1984. On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure. Manag. Science, 30, (5): 644?647.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献