WSPT's Competitive Performance for Minimizing the Total Weighted Flow Time: From Single to Parallel Machines

WSPT's Competitive Performance for Minimizing the Total Weighted Flow Time: From Single to Parallel Machines

We consider the classical online scheduling problem over single and parallel machines with the objective of minimizing total weighted flow time. We employ an intuitive and systematic analysis method and show that the weighted shortest processing time (WSPT) is an optimal online algorithm with the co...

Full description

Bibliographic Details
Main Authors:	Jiping Tao, Tundong Liu
Format:	Article
Language:	English
Published:	Hindawi Limited 2013-01-01
Series:	Mathematical Problems in Engineering
Online Access:	http://dx.doi.org/10.1155/2013/343287

Similar Items

A Competitive Online Algorithm for Minimizing Total Weighted Completion Time on Uniform Machines
by: Xuyang Chu, et al.
Published: (2020-01-01)

Parallel-Machine Scheduling to Minimize Total Weighted Flow Time
by: An-Shih Lee, et al.
Published: (2012)

Minimize the total weighted completion time on parallel machines subject to machine and chamber eligibilities
by: Yu-An Tu, et al.
Published: (2018)

Minimizing Total Weighted Completion Time on Parallel Machines with Family Set-up Times
by: CHEN, LIANG-CHUAN, et al.
Published: (2009)

Scheduling Unrelated Parallel-Machine to Minimize Total Weighted Tardiness
by: Yang-Kuei Lin, et al.
Published: (2001)

Two-agent scheduling to minimize total weighted completion time on parallel identical machines
by: 林玫君
Published: (2013)

Scheduling correlated parallel machines to minimize maximum lateness and total weighted completion time
by: ZHANG, YUN-XI, et al.
Published: (2018)

Minimizing the Total Weighted Completion Time of a Single Machine With Flexible Maintenance
by: Shenquan Huang, et al.
Published: (2019-01-01)

Minimizing the total completion time of parallel machines with machine and chamber eligibilities
by: SSU-MIN CHANG, et al.
Published: (2018)

Correlated Parallel Machine Scheduling with Release Times to Minimize Total Weighted Completion Time and Number of Tardy Jobs
by: YIN, TZU-YUEH, et al.
Published: (2018)

Single-machine scheduling to minimize the total weighted completion time with release times and two-agents
by: Shan-Ci Liao, et al.
Published: (2011)

Minimizing Total Weighted Completion Time and Maximum Lateness on Single Machine Scheduling Problems
by: Ying-Chun Liu, et al.

Minimizing Total Weighted Completion Time on a Single-Machine with Maximum Earliness Constraint
by: Mao-Chan Weng, et al.
Published: (2008)

Single Machine Scheduling With Unequal Release Date to Minimize Total Weighted Completion Time
by: Jan-Nen Chen, et al.

Minimizing total completion time on unrelated parallel machine with machine eligibility restriction
by: Chun-Wei Li, et al.
Published: (2007)

Preemptive Parallel Machines Scheduling Problem with Minimizing Total Completion Time
by: Lo, Yu-Hsuan, et al.
Published: (2019)

Minimizing Total Flowtime with Arrival Time in Batches on Identical Parallel Machines
by: Tsui-Ping Chung, et al.
Published: (2007)

Single-machine scheduling with both deterioration and learning effects to Minimize Total Weighted Completion Time
by: Yu-Chun Wang, et al.
Published: (2010)

Minimizing Discounted Total Weighted Completion Time on a Single-Machine with Maximum Earliness Constraint
by: Po-Kuan Wu, et al.
Published: (2009)

Identical Parallel Machine Scheduling with Machine Availability Constraint to Minimize Total Completion Time
by: Yung-Yu Tsou, et al.
Published: (2017)

Integrated process planning, WSPT scheduling and WSLK due-date assignment using genetic algorithms and evolutionary strategies
by: Halil Ibrahim Demir, et al.
Published: (2017-12-01)

Minimizing the total tardiness of parallel machine with machine and chamber eligibilities
by: Tsung-Ting Tsai, et al.
Published: (2018)

Parallel machine scheduling with splitting jobs and setup times to minimize total completion times.
by: Wei-Chen Chang, et al.
Published: (2012)

The Parallel Batch Machine Scheduling with Machine Eligibility and Waiting Time Constraints to Minimize Total Completion Time
by: Yi-Hua Huang, et al.
Published: (2018)

Minimizing total weighted tardiness for the single machine scheduling problem with dependent setup time and precedence constraints
by: Hamidreza Haddad, et al.
Published: (2012-04-01)

Parallel machine scheduling with flexible maintenance activities for minimizing total completion time
by: Wen-Chih Hsu, et al.
Published: (2013)

Single-machine batch scheduling minimizing weighted flow times and delivery costs with job release times
by: Amir Ebrahimzadeh Pilerood, et al.
Published: (2012-04-01)

Fuzzy Programming for Parallel Machines Scheduling: Minimizing Weighted Tardiness/Earliness and Flow Time through Genetic Algorithm
by: Mohammad Asghari, et al.
Published: (2014-03-01)

Approximation of Identical Parallel Machine Scheduling with Machine Availability Constraint to Minimize Total Completion Time
by: Chih-Chia Lin, et al.
Published: (2018)

Scheduling on identical parallel machines to minimize total completion time with deadline constraint and machine eligibility
by: Cheng-Chao Lin, et al.
Published: (2007)

Preemptive Parallel Machine Scheduling with Machine Availability and Eligibility Constraints to Minimize Total Completion Time
by: Ko-hsuan Pao, et al.
Published: (2015)

Minimize the total completion times on parallel machines subject to both machine eligibilities resource constraints
by: Zhi-Xiang Cai, et al.
Published: (2017)

Identical Parallel Machine Scheduling with Machine Availability and Eligibility Constraints to Minimize Total Completion Time
by: Yu-Cyuan Chen, et al.
Published: (2016)

Minimizing makespan subject to minimize total absolute deviation of completion time in an identical parallel machine system
by: Feng-Sheng Che, et al.
Published: (2010)

Study on single machine scheduling problems with deteriorating jobs and learning effects to Minimize Total Weighted Completion Time
by: Chun-Yu Wang, et al.
Published: (2010)

Ant colony optimization for scheduling unrelated parallel machines with learning effects to minimize total weighted tardiness
by: Han-ting Hsieh, et al.
Published: (2011)

Parallel Machine Scheduling with Flexible Maintenance and Resumable Jobs for Minimizing Total Completion Time
by: Shang-Cheng Tsai, et al.
Published: (2017)

Parallel Machine Scheduling with Flexible Maintenance Activity Periods for Minimizing Total Completion Time
by: Yen-han Li, et al.
Published: (2014)

Parallel machine scheduling with flexible and deteriorating maintenance activities for minimizing the total completion time
by: Kai-Hung Wang, et al.
Published: (2016)

Minimizing Total Weighted Tardiness with Drop Dead Dates in Single Machine Scheduling Problem
by: Mohammad Mahdavi Mazdeh, et al.
Published: (2010-05-01)