Minimizing the Total Stretch in Flow Shop Scheduling

Yoon, Suk-Hun

doi:10.7737/msfe.2014.20.2.033

Management Science and Financial Engineering

2014

DOI: 10.7737/msfe.2014.20.2.033

|View full text |Cite

Minimizing the Total Stretch in Flow Shop Scheduling

Suk-Hun Yoon

Abstract: A flow shop scheduling problem involves scheduling jobs on multiple machines in series in order to optimize a given criterion. The flow time of a job is the amount of time the job spent before its completion and the stretch of the job is the ratio of its flow time to its processing time. In this paper, a hybrid genetic algorithm (HGA) approach is proposed for minimizing the total stretch in flow shop scheduling. HGA adopts the idea of seed selection and development in order to reduce the chance of premature co… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2014

Publication Types

Select...

Article2

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Complexity Results for the Design Problem of Content Distribution Networks

Choi¹,

Chung²

2014

Management Science and Financial Engineering

View full text Add to dashboard Cite

Content Delivery Network (CDN) has evolved to overcome a network bottleneck and improve user perceived Quality of Service (QoS). A CDN replicates contents from the origin server to replica servers to reduce the overload of the origin server. CDN providers would try to achieve an acceptable performance at the least cost including the storage space or processing power. In this paper, we introduce a new optimization model for the CDN design problem considering the user perceived QoS and single path (non-bifurcated) routing constraints and analyze the computational complexity for some special cases.

show abstract

Complexity Results for the Design Problem of Content Distribution Networks

Choi¹,

Chung²

2014

Management Science and Financial Engineering

View full text Add to dashboard Cite

show abstract

Assortment Optimization under Consumer Choice Behavior in Online Retailing

Lee¹,

Kim

2014

Management Science and Financial Engineering

View full text Add to dashboard Cite

This paper studies the assortment optimization problem in online retailing by using a multinomial logit model in order to take consumer choice behavior into account. We focus on two unique features of online purchase behavior: first, there exists increased amount of uncertainty (e.g., size and color of merchandize) in online shopping as customers cannot experience merchandize directly. This uncertainty is captured by the scale parameter of a Gumbel distribution; second, online shopping entails unique shopping-related disutility (e.g., waiting time for delivery and security concerns) compared to offline shopping. This disutility is controlled by the changes in the observed part of utility function in our model. The impact of changes in uncertainty and disutility on the expected profit does not exhibit obvious structure: the expected profit may increase or decrease depending on the assortment. However, by analyzing the structure of the optimal assortment based on convexity property of the profit function, we show that the cardinality of the optimal assortment decreases and the maximum expected profit increases as uncertainty or disutility decreases. Therefore, our study suggests that it is important for managers of online retailing to reduce uncertainty and disutility involved in online purchase process.

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Minimizing the Total Stretch in Flow Shop Scheduling

Cited by 2 publications

References 12 publications

Complexity Results for the Design Problem of Content Distribution Networks

Complexity Results for the Design Problem of Content Distribution Networks

Assortment Optimization under Consumer Choice Behavior in Online Retailing

Contact Info

Product

Resources

About