Advanced search
Publication Cover
International Journal of Production Research Volume 26, 1988 - Issue 7
Submit an article Journal homepage
86
Views
43
CrossRef citations to date
0
Altmetric
Original Articles

An improved branching scheme for the branch and bound procedure of scheduling n jobs on m parallel machines to minimize total weighted flowtime

SUBHASH C. SARIN Department of Industrial Engineering and Operations Research, Virginia Polytechnic Institute and State University, Blacksburg, Virginia, 24061, USA
,
SEOKYOO AHN Korea Institute of Defense Academy, Seoul, S. Korea
&
ALBERT B. BISHOP Department of Industrial and Systems Engineering, The Ohio State University, Columbus, Ohio, 43210, USA
Pages 1183-1191 | Received 01 Sep 1987, Published online: 07 May 2007

Citations (43)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (9)

Michael F. Gorman & Daniel G. Conway. (2018) A tutorial of integrating duality and branch and bound in earliness–tardiness scheduling with idle insertion time problems. International Journal of Production Research 56:1-2, pages 262-277.
Read now
P. Hungerländer. (2017) The checkpoint ordering problem. Optimization 66:10, pages 1699-1712.
Read now
Ching-Fang Liaw. (2016) A branch-and-bound algorithm for identical parallel machine total tardiness scheduling problem with preemption. Journal of Industrial and Production Engineering 33:6, pages 426-434.
Read now
Ching-Fang Liaw. (2016) A branch-and-bound algorithm for identical parallel-machine total completion time scheduling problem with preemption and release times. Journal of Industrial and Production Engineering 33:6, pages 383-390.
Read now
A J Ruiz-Torres, F J López, P J Wojciechowski & J C Ho. (2010) Parallel machine scheduling problems considering regular measures of performance and machine cost. Journal of the Operational Research Society 61:5, pages 849-857.
Read now
Dong Cao & Mingyuan Chen. (2003) Parallel flowshop scheduling using Tabu search. International Journal of Production Research 41:13, pages 3059-3073.
Read now
CHUNG-YEE LEE & XIAOQIANG CAI. (1999) Scheduling one and two-processor tasks on two parallel processors. IIE Transactions 31:5, pages 445-455.
Read now
MERAL AZIZOGLU & OMER KIRCA. (1999) Scheduling jobs on unrelated parallel machines to minimize regular total cost functions. IIE Transactions 31:2, pages 153-159.
Read now
V. CHANDRU, C.-Y. LEE & R. UZSOY. (1993) Minimizing total completion time on batch processing machines. International Journal of Production Research 31:9, pages 2097-2121.
Read now

Articles from other publishers (34)

Raja Awais Liaqait, Shermeen Hamid, Salman Sagheer Warsi & Azfar Khalid. (2021) A Critical Analysis of Job Shop Scheduling in Context of Industry 4.0. Sustainability 13:14, pages 7684.
Crossref
Arthur Kramer, Mauro Dell’Amico & Manuel Iori. (2019) Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines. European Journal of Operational Research 275:1, pages 67-79.
Crossref
Jian Zhang, Guofu Ding, Yisheng Zou, Shengfeng Qin & Jianlin Fu. (2017) Review of job shop scheduling research and its new perspectives under Industry 4.0. Journal of Intelligent Manufacturing 30:4, pages 1809-1830.
Crossref
Kerem Bülbül & Halil Şen. (2016) An exact extended formulation for the unrelated parallel machine total weighted completion time problem. Journal of Scheduling 20:4, pages 373-389.
Crossref
Michael L. PinedoMichael L. Pinedo. 2016. Scheduling. Scheduling 113 150 .
Jeng-Fung Chen. (2013) Unrelated parallel-machine scheduling to minimize total weighted completion time. Journal of Intelligent Manufacturing 26:6, pages 1099-1112.
Crossref
Corinna Kaufmann. 2014. Operations Research Proceedings 2013. Operations Research Proceedings 2013 231 236 .
F. J. Rodriguez, C. Blum, C. García-Martínez & M. Lozano. (2012) GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times. Annals of Operations Research 201:1, pages 383-401.
Crossref
Johnny C. Ho, Francisco J. López, Alex J. Ruiz-Torres & Tzu-Liang (Bill) Tseng. (2009) Minimizing total weighted flowtime subject to minimum makespan on two identical parallel machines. Journal of Intelligent Manufacturing 22:2, pages 179-190.
Crossref
Rabia Nessah & Chengbin Chu. (2010) Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods. Annals of Operations Research 181:1, pages 359-375.
Crossref
Tsui-Ping Chung, Ching-Jong Liao & Ling-Huey Su. (2010) Scheduling on identical machines with batch arrivals. International Journal of Production Economics 123:1, pages 179-186.
Crossref
Min LIU. (2009) A Survey of Data-based Production Scheduling Methods. Acta Automatica Sinica 35:6, pages 785-806.
Crossref
Kai Li & Shan-lin Yang. (2009) Non-identical parallel-machine scheduling research with minimizing total weighted completion times: Models, relaxations and algorithms. Applied Mathematical Modelling 33:4, pages 2145-2158.
Crossref
T. P. Chung, C. J. Liao & L. H. Su. (2008) Scheduling on identical machines with batch arrivals in semiconductor testing house. Scheduling on identical machines with batch arrivals in semiconductor testing house.
Rabia Nessah, Farouk Yalaoui & Chengbin Chu. (2008) A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates. Computers & Operations Research 35:4, pages 1176-1190.
Crossref
Rabia Nessah, Chengbin Chu & Farouk Yalaoui. (2007) An exact method for problem. Computers & Operations Research 34:9, pages 2840-2848.
Crossref
Rabia Nessah & Farouk Yalaoui. (2006) A branch and bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates. A branch and bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates.
F. Yalaoui & C. Chu. (2006) New exact method to solve the Pm/rj/∑Cj schedule problem. International Journal of Production Economics 100:1, pages 168-179.
Crossref
Simon Dunstall & Andrew Wirth. (2005) A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines. European Journal of Operational Research 167:2, pages 283-296.
Crossref
K.P. Adzakpa, K.H. Adjallah & J. Lee. (2003) A new effective heuristic for the intelligent management of the preventive maintenance tasks of the distributed systems. Advanced Engineering Informatics 17:3-4, pages 151-163.
Crossref
F. Yalaoui & C. Chu. (2000) Parallel Machine Scheduling to Minimize Total Completion Time with Release Dates Constraints. IFAC Proceedings Volumes 33:17, pages 715-722.
Crossref
J. M. van den Akker, J. A. Hoogeveen & S. L. van de Velde. (1999) Parallel Machine Scheduling by Column Generation. Operations Research 47:6, pages 862-872.
Crossref
Zhi-Long Chen & Warren B. Powell. (1999) Solving Parallel Machine Scheduling Problems by Column Generation. INFORMS Journal on Computing 11:1, pages 78-94.
Crossref
Meral Azizoglu & Omer Kirca. (1999) On the minimization of total weighted flow time with identical and uniform parallel machines. European Journal of Operational Research 113:1, pages 91-100.
Crossref
Bo Chen, Chris N. Potts & Gerhard J. Woeginger. 1999. Handbook of Combinatorial Optimization. Handbook of Combinatorial Optimization 1493 1641 .
Hanif D. Sherali, Youngho Lee & Donald D. Boyer. (1995) Scheduling target illuminators in naval battle-group anti-air warfare. Naval Research Logistics 42:5, pages 737-755.
Crossref
Scott Webster. (1995) Weighted flow time bounds for scheduling identical processors. European Journal of Operational Research 80:1, pages 103-111.
Crossref
Tien-Hsiang Sun, Chao-Weng Cheng & Li-Chen Fu. (1994) A Petri net based approach to modeling and scheduling for an FMS and a case study. IEEE Transactions on Industrial Electronics 41:6, pages 593-601.
Crossref
Youngho Lee & Hanif D. Sherali. (1994) Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem. Annals of Operations Research 50:1, pages 339-365.
Crossref
H. Belouadah & C.N. Potts. (1994) Scheduling identical parallel machines to minimize total weighted completion time. Discrete Applied Mathematics 48:3, pages 201-218.
Crossref
Eugene L. Lawler, Jan Karel Lenstra, Alexander H.G. Rinnooy Kan & David B. Shmoys. 1993. Logistics of Production and Inventory. Logistics of Production and Inventory 445 522 .
Chung-Yee Lee & Reha Uzsoy. (1992) A new dynamic programming algorithm for the parallel machines total weighted completion time problem. Operations Research Letters 11:2, pages 73-75.
Crossref
T.C.E. Cheng & C.C.S. Sin. (1990) A state-of-the-art review of parallel-machine scheduling research. European Journal of Operational Research 47:3, pages 271-292.
Crossref
L.C. Hendry & B.G. Kingsman. (1989) Production planning systems and their applicability to make-to-order companies. European Journal of Operational Research 40:1, pages 1-15.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.