Note—On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure
Published Online:1 May 1984https://doi.org/10.1287/mnsc.30.5.644
- Cited by
- Computers & Industrial Engineering, Vol. 162
- Operations Research Letters, Vol. 41, No. 5
- Computers & Operations Research, Vol. 39, No. 5
- European Journal of Operational Research, Vol. 165, No. 2
- Computers & Industrial Engineering, Vol. 46, No. 3
- IIE Transactions, Vol. 36, No. 1
- European Journal of Operational Research, Vol. 143, No. 1
- European Journal of Operational Research, Vol. 125, No. 2
- Computers & Industrial Engineering, Vol. 32, No. 1
- Artificial Intelligence, Vol. 86, No. 1
- IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, Vol. 26, No. 1
- Naval Research Logistics, Vol. 42, No. 8
- European Journal of Operational Research, Vol. 51, No. 2
- Operations Research Letters, Vol. 9, No. 2
- IEEE Transactions on Robotics and Automation, Vol. 6, No. 6
- IEEE Transactions on Reliability, Vol. 38, No. 2
Volume 30, Issue 5
May 1984
Pages 533-651
Article Information
Metrics
Information
- Published Online:May 01, 1984
© 1984 INFORMS
Cite as
Sushil K. Gupta, Tapan Sen, (1984) Note—On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure. Management Science 30(5):644-647.
https://doi.org/10.1287/mnsc.30.5.644
Keywords
