Job block scheduling with dual criteria and sequence-dependent setup time involving transportation times

1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A two-machine flowshop scheduling with sequence-dependent setup time (SDST), job block, and transportation time is considered with the objective of minimizing makespan and the rental cost of machines taken on rent under a specified rental policy. The processing time of attributes on these machines is associated with probabilities. To find the optimal or near-optimal solution for these objectives, a heuristic algorithm is developed. To test the efficiency of the proposed heuristic algorithm, a numerical illustration is given.

Cite

CITATION STYLE

APA

Gupta, D., Nailwal, K. K., & Sharma, S. (2014). Job block scheduling with dual criteria and sequence-dependent setup time involving transportation times. In Advances in Intelligent Systems and Computing (Vol. 246, pp. 321–329). Springer Verlag. https://doi.org/10.1007/978-81-322-1680-3_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free