Skip to main content
Fachgebiete
Automobil + Motoren Bauwesen + Immobilien Business IT + Informatik Elektrotechnik + Elektronik Energie + Nachhaltigkeit Finance + Banking Management + Führung Marketing + Vertrieb Maschinenbau + Werkstoffe Versicherung + Risiko
DE
EN
Bücher
Zeitschriften
Themenseiten
Organisationspsychologie Projektmanagement Marketing Smart Manufacturing
Weitere Formate
Podcasts Webinare Technik Webinare Wirtschaft Kongresse Veranstaltungskalender Awards
Jetzt Einzelzugang starten
Zugang für Unternehmen
Referenzkunden
SLX-Digitalkonferenz: Zukunftswerkstatt 2024

Mehr Umsatz mit Top-Kontakten

Am 7. Mai erfahren Sie, wie Vertriebsteams Leadgenerierung, Leadnurturing und Leadstrategien effizient steuern können.
Erweiterte Suche
Anmelden
nach oben
Erschienen in:
The Robber Strikes Back Kapitel lesen Erstes Kapitel lesen

2014 | OriginalPaper | Buchkapitel

Job Block Scheduling with Dual Criteria and Sequence-Dependent Setup Time Involving Transportation Times

verfasst von : Deepak Gupta, Kewal Krishan Nailwal, Sameer Sharma

Erschienen in: Computational Intelligence, Cyber Security and Computational Models

Verlag: Springer India

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Jetzt informieren
Vorheriges Kapitel Iso-Triangular Pictures and Recognizability
Nächstes Kapitel Modular Chromatic Number of C m  □ C n
Literatur
1.
A. Allahverdi, J.N.D. Gupta, T. Aldowaisan, “A review of scheduling research involving setup considerations”, OMEGA, The International Journal of Management Sciences, 27, 1999, pp. 219–239.
2.
A. Allahverdi, C.T. Ng, T.C.E. Cheng, M.Y. Kovalyov, “A survey of scheduling problems with setup times or costs”, European Journal of Operational Research, 187, 2008, pp. 985–1032.
3.
P.C. Bagga and A. Bhambani, “Bicriteria in flow shop scheduling problem”, Journal of Combinatorics, Information and System Sciences, 22, 1999, pp. 63–83.
4.
K.R. Baker, “Introduction to Sequencing and Scheduling”, Wiley: New York, 1974.
5.
H.G. Campbell, R.A. Dudek, and M.L. Smith, “A heuristic algorithm for the n-job, m-machine sequencing problem”, Management Science, 16, 1970, pp. 630–637.
6.
B.D. Crown and A.O. Esogbue, “Two machine flow shop scheduling problems with sequence dependent setup time: a dynamic programming approach”, Naval Research Logistics Quarterly, 21, 1974, pp. 515–523.
7.
C. Gagne, W.L. Price, M. Gravel, “Comparing an ACO algorithm with other heuristics for the single machine scheduling problem with sequence-dependent setup times”, Journal of the Operational Research Society 53, 2002, pp. 895–906.
8.
Y. Gajpal, C. Rajendran and H. Ziegler, “An ant colony algorithm for scheduling in flow shop with sequence dependent set times of jobs”, The international Journal of Advanced Manufacturing Technology, 30(5-6), 2006, pp. 416–424.
9.
D. Gupta, S. Sharma, Seema and Shefali, “nx2 bicriteria flowshop scheduling under specified rental policy, processing time and setup time each associated with probabilities including job block”, European Journal of Business and Management, 3(3) (2012) pp. 268–286.
10.
D. Gupta, S. Sharma, Seema and K.K. Nailwal, “A bicriteria two machine flowshop scheduling with sequence dependent setup time”, International Journal of Mathematical Sciences, 11(3-4), 2012, pp. 183–196.
11.
D. Gupta, S. Sharma, Seema and K.K. Nailwal, “Bicriteria job block scheduling with sequence dependent setup time”, Proceedings of the International Conference on Optimization, Computing and Business Analytics, 2012, pp. 8-13.
12.
J.N.D. Gupta and W.P. Darrow, “The two machine sequence dependent flowshop scheduling problem”, European Journal of Operational Research, 24(3) (1974) 439–446.
13.
S.R. Gupta, J.S. Smith, “Algorithms for single machine total tardiness scheduling with sequence dependent setups”, European Journal of Operational Research, 175, 2006, pp. 722–739.
14.
S.M. Johnson, “Optimal two and three stage production schedule with set up times included”, Naval Research Logistics Quarterly. 1(1) (1954) 61–68.
15.
P.L. Maggu and G. Das, “Equivalent jobs for job block in job scheduling”, Opsearch, 14(4) (1977) 277–281.
16.
P.L. Maggu P and G. Das, “Elements of Advanced Production Scheduling”, United Publishers and Periodical Distributors, 1985.
17.
M. Nawaz, Jr.E.E. Enscore and I. Ham, “A heuristic algorithm for the m-machine n-job flowshop sequencing problem”, OMEGA, International Journal of Management Science, 11, 1983, pp. 91–95.
18.
D.S. Palmer, “Sequencing jobs through a multi-stage process in the minimum total time - a quick method of obtaining a near-optimum”, Operational Research Quarterly, 16(1) (1965) 101–107.
19.
M.L. Pinedo, “Scheduling: Theory, Algorithms, and Systems”, Third Edition, Springer, 2008.
20.
G. Rabadi, M. Mollaghasemi, and G.C. Anagnostopoulos, “A branch-and-bound algorithm for the early/tardy machine scheduling problem with a common due-date and sequence dependent setup time”, Computers and Operations Research 31, 2004, pp. 1727–1751.
21.
C. Rajendran, H. Ziegler, “A heuristic for scheduling to minimize the sum of weighted flowtime of jobs in a flowshop with sequence-dependent setup times of jobs”, Computers and Industrial Engineering 33, 1997, pp. 281–284.
22.
R.Z. Rıos-Mercado, J.F. Bard, “A branch-and-bound algorithm for permutation flow shops with sequence-dependent setup times”, IIE Transactions 31, 1999, pp. 721–731.
23.
K.C. Tan, R. Narasimhan, “Minimizing tardiness on a single processor with sequence-dependent setup times: A simulated annealing approach”, OMEGA, 25, 1997, pp. 619–634.
24.
L.N. Van Wassenhove and L.F. Gelders, “Solving a bicriteria scheduling problem”, AIIE Tran 15 s, 1980, pp. 84–88.
Metadaten
Titel
Job Block Scheduling with Dual Criteria and Sequence-Dependent Setup Time Involving Transportation Times
verfasst von
Deepak Gupta
Kewal Krishan Nailwal
Sameer Sharma
Copyright-Jahr
2014
Verlag
Springer India
Buch
Computational Intelligence, Cyber Security and Computational Models

Print ISBN: 978-81-322-1679-7

Electronic ISBN: 978-81-322-1680-3

Copyright-Jahr: 2014

DOI
https://doi.org/10.1007/978-81-322-1680-3_35