A New Branch-And-Bound Approach For The N/2/Flowshop/Alpha F+Beta C-Max Flowshop Scheduling Problem

DSpace/Manakin Repository

Search OPUS

Advanced Search


My Account

Show simple item record

dc.contributor.author Yeh, W
dc.date.accessioned 2012-02-02T11:13:00Z
dc.date.issued 1999-01
dc.identifier.citation Computers & Operations Research, 1999, 26 (13), pp. 1293 - 1310
dc.identifier.issn 0305-0548
dc.identifier.other E2 en_US
dc.identifier.uri http://hdl.handle.net/10453/16747
dc.description.abstract In this study, a special situation involving a computationally di$cult #owshop scheduling problem is discussed. The objective of this problem is to minimize a weighted combination of job #owtime and schedule makespan. An e$cient Branch-and-Bound approach is developed here to solve this problem. The primary reason for developing this Branch-and-Bound approach is that its results can usefully guide other heuristic techniques, such as simulated annealing, tabu search, and genetic algorithms, in "nding optimal or good quality solutions to larger sized problems. As evidence of the utility of the proposed approach, we present extensive computational results on random test problems. Our results compare favorably with previously developed algorithms in the literature.
dc.format Esha Dutt
dc.publisher Pergamon-Elsevier Science Ltd
dc.relation.isbasedon 10.1016/S0305-0548(98)00106-3
dc.subject Flowshop scheduling, Branch-and-bound, Computational analysis, Operations Research, 0102 Applied Mathematics, 0103 Numerical And Computational Mathematics
dc.subject Flowshop scheduling; Branch-and-bound; Computational analysis; Operations Research
dc.title A New Branch-And-Bound Approach For The N/2/Flowshop/Alpha F+Beta C-Max Flowshop Scheduling Problem
dc.type Journal Article
dc.parent Computers & Operations Research
dc.journal.volume 13
dc.journal.volume 26
dc.journal.number en_US
dc.publocation Piscataway, USA en_US
dc.identifier.startpage 1 en_US
dc.identifier.endpage 5 en_US
dc.cauo.name FEIT.Faculty of Engineering & Information Technology en_US
dc.conference Verified OK en_US
dc.for 0102 Applied Mathematics
dc.for 0102 Applied Mathematics
dc.for 0103 Numerical And Computational Mathematics
dc.personcode 0000068010 en_US
dc.personcode 0000068011 en_US
dc.personcode 0000068012 en_US
dc.personcode 0000068013 en_US
dc.personcode 0000068014 en_US
dc.personcode 0000068015 en_US
dc.personcode 11140391 en_US
dc.percentage 100 en_US
dc.classification.name Communications Technologies en_US
dc.classification.type FOR-08 en_US
dc.edition en_US
dc.custom International Conference on Computer and Communication Engineering en_US
dc.date.activity 20100511 en_US
dc.location.activity KL, Malaysia en_US
dc.location.activity ISI:000082714800003
dc.description.keywords Bandwidth request; Connection managements; Group scheduling; IEEE 802.16j; Mesh; Mesh topologies; Multi-hop relay; Multi-hop relay networks; Network simulation; Relay stations; Simulation result; Support functions; Throughput performance; WiMAX networks; en_US
dc.description.keywords Flowshop scheduling
dc.description.keywords Branch-and-bound
dc.description.keywords Computational analysis
dc.staffid en_US
pubs.embargo.period Not known
pubs.organisational-group /University of Technology Sydney
pubs.organisational-group /University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group /University of Technology Sydney/Faculty of Engineering and Information Technology/School of Software
utslib.copyright.status Closed Access
utslib.copyright.date 2015-04-15 12:17:09.805752+10
pubs.declined 2014-11-24T17:30:28.763+1100
pubs.declined 2014-11-24T17:30:28.109+1100
pubs.declined 2014-11-24T17:30:29.819+1100
pubs.declined 2014-11-24T17:30:37.211+1100
pubs.declined 2015-03-13T13:31:30.786+1100
pubs.declined 2015-03-13T13:31:30.809+1100
pubs.declined 2015-03-13T13:31:30.810+1100
pubs.declined 2015-03-13T13:31:31.48+1100
pubs.declined 2015-03-13T13:31:33.90+1100
pubs.declined 2015-03-13T13:31:33.329+1100
pubs.declined 2015-03-13T13:35:25.504+1100
pubs.declined 2015-03-13T17:04:42.974+1100
pubs.declined 2015-03-13T19:00:14.144+1100
pubs.declined 2015-03-13T19:04:43.6+1100
pubs.declined 2015-03-13T19:06:03.818+1100
pubs.declined 2015-03-13T19:30:16.610+1100
pubs.declined 2015-03-13T19:36:45.44+1100
pubs.declined 2015-03-13T21:06:33.246+1100
pubs.declined 2015-03-13T21:16:16.583+1100
pubs.declined 2015-03-13T22:28:36.505+1100
pubs.declined 2015-03-13T22:43:05.722+1100
pubs.declined 2015-03-13T23:40:43.485+1100
pubs.declined 2015-03-13T23:51:16.992+1100
pubs.declined 2015-03-14T00:48:09.727+1100
pubs.declined 2015-03-14T00:59:10.745+1100
pubs.declined 2015-03-14T01:28:11.320+1100
pubs.declined 2015-03-14T02:12:45.792+1100

Files in this item

This item appears in the following Collection(s)

Show simple item record