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:
Buchtitelbild

2012 | OriginalPaper | Buchkapitel

1. Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey

verfasst von : Dvir Shabtay, George Steiner

Erschienen in: Just-in-Time Systems

Verlag: Springer New York

Einloggen

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

search-config
loading …

Abstract

In just-in-time (JIT) scheduling, the usual objective is to minimize a cost function which includes a penalty for both the early and tardy completion of jobs. In this paper, we survey results for a cost function that is related to the number of early and tardy jobs rather than the actual earliness and tardiness values. More specifically, we study the problem of maximizing the weighted number of jobs which are completed exactly on their due date (i.e., in JIT mode). Our survey covers the literature for various scheduling environments both with fixed and controllable processing times. We also describe several new algorithms for certain flow-shop problems.

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
Nächstes Kapitel An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem
Literatur
1.
Alidaee, B., Ahmadian, A.: Two Parallel Machine Sequencing Problems Involving Controllable Job Processing Times. European Journal of Operational Research 70, 335-341 (1993)MATHCrossRef
2.
Arkin, E.M., Silverberg, E.L.: Scheduling Jobs with Fixed Start and Finish Times. Discrete Applied Mathematics 18, 1-8 (1987)MATHCrossRefMathSciNet
3.
Baker, K.R., Scudder, G.D.: Sequencing with Earliness and Tardiness Penalties: A Review. Operations Research 38, 22-36 (1990)MATHCrossRefMathSciNet
4.
5.
Carlisle, M.C., Lloyd, E.L.: On the k-coloring of Intervals. Discrete Applied Mathematics 59, 225-235 (1995)MATHMathSciNet
6.
Cheng, T.C.E., Janiak, A., Kovalyov, M.Y.: Bicriterion Single Machine Scheduling with Resource Dependent Processing Times. SIAM Journal on Optimization 8(2), 617-630 (1998)MATHCrossRefMathSciNet
7.
Choi, B.C., Yoon, S.H.: Maximizing the Weighted Number of Just-in-Time Jobs in Flow Shop Scheduling. Journal of Scheduling 10, 237-243 (2007)MATHCrossRefMathSciNet
8.
Čepek, O., Sung, S. C.: A Quadratic Time Algorithm to Maximize the Number of Just-in-Time Jobs on Identical Parallel Machines. Computers and Operations Research 32, 3265-3271 (2005)MATHCrossRefMathSciNet
9.
Chudzik, K., Janiak, A., Lichtenstein, M.: Scheduling Problems with Resource Allocation. In A. Janiak, ed., Scheduling in Computer and Manufacturing Systems, WK L, Warszawa (2006)
10.
Frank, A.: On Chains and Antichains Families of a Partially Ordered Set. Journal of Combinatorial Theory Series B 29, 176-184 (1980)MATHCrossRefMathSciNet
11.
Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and Approximation in Deterministic Sequencing and Scheduling: A Survey. Annals Discrete Mathematics 5, 287-326 (1979)
12.
Hsiao, J.Y., Tang, C.Y., Chang, R.S.: An Efficient Algorithm for Finding a Maximum Weight  2-independent Set of Interval Graphs. Information Processing Letters 43, 229-235 (1992)MATHCrossRefMathSciNet
13.
Hiraishi, K., Levner, E., Vlach, M.: Scheduling of Parallel Identical Machines to Maximize the Weighted Number of Just-in-Time Jobs. Computers and Operations Research 29(7), 841-848 (2002)MATHCrossRefMathSciNet
14.
Janiak, A.: One-Machine Scheduling with Allocation of Continuously-Divisible Resource and with No Precedence Constraints. Kybernetika 23(4), 289-293 (1987)MATHMathSciNet
15.
Janiak, A., Kovalyov, M.Y.: Single Machine Scheduling Subject to Deadlines and Resource Dependent Processing Times. European Journal of Operational Research 94, 284-291 (1996)MATHCrossRef
16.
Janiak, A., Janiak, W., Lichtenstein, M.: Resource Management in Machine Scheduling Problems: A Survey. Decision Making in Manufacturing and Services 1, 59-89 (2007)MATHMathSciNet
17.
Józefowska, J.: Just-in-time Scheduling: Models and Algorithms for Computer and Manufacturing Systems, Springer-Verlag New York Inc (2007)
18.
Kaspi, M., Shabtay, D.: Optimization of Machining Economics Problem for a Multi-Stage Transfer Machine Under Failure, Opportunistic and Integrated Replacement Strategies. International Journal of Production Research 41(10), 2229-2248 (2003)MATHCrossRef
19.
Kayan, R.K., Akturk, M.S.: A New Bounding Mechanism for the CNC Machine Scheduling Problem with Controllable Processing Times. European Journal of Operational Research 167, 624-643 (2005)MATHCrossRefMathSciNet
20.
Kovalyov, M.Y., Ng, C.T., Cheng, T.C.E.: Fixed Interval Scheduling: Models, Applications, Computational Complexity and Algorithms. European Journal of Operational Research 178, 331-342 (2007)MATHCrossRefMathSciNet
21.
Lann, A., Mosheiov, G.: Single Machine Scheduling to Minimize the Number of Early and Tardy Jobs. Computers and Operations Research 23, 765-781 (1996)CrossRef
22.
Leyvand Y., Shabtay, D., Steiner, G., Yedidsion, L.: Just-in-Time Scheduling with Controllable Processing Times on Parallel Machines. Journal of Combinatorial Optimization 19(3), 347-368 (2010)MATHCrossRefMathSciNet
23.
Ng, C.T.D., Cheng, T.C.E., Janiak, A., Kovalyov, M.Y.: Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time. Annals of Operations Research 133, 163-174 (2005)MATHCrossRefMathSciNet
24.
Nowicki, E., Zdrzalka, S.: A Survey of Results for Sequencing Problems with Controllable Processing Times. Discrete Applied Mathematics 26, 271-287 (1990)MATHCrossRefMathSciNet
25.
Pal, M., Bhattacharjee, G.P.: A Sequential Algorithm for Finding a Maximum Weight K-independent Set on Interval Graphs. International Journal of Computer Mathematics 60, 205-214 (1996)MATHCrossRef
26.
Saha, A., Pal, M.: Maximum Weight k-independent Set Problem on Permutation Graphs. International Journal of Computer Mathematics 80, 1477-1487 (2003)MATHCrossRefMathSciNet
27.
28.
Shabtay, D.: Single and a Two-Resource Allocation Algorithms for Minimizing the Maximal Lateness in a Single Machine-Scheduling Problem. Computers and Operations Research, 31(8), 1303-1315 (2004)MATHCrossRef
29.
Shabtay, D., Kaspi, M.: Minimizing the Total Weighted Flow Time in a Single Machine with Controllable Processing Times. Computers and Operations Research 31(13), 2279-2289 (2004)MATHCrossRefMathSciNet
30.
Shabtay, D., Kaspi, M., Steiner, G.: The No-Wait Two-Machine Flow-Shop Scheduling Problem with Convex Resource-Dependent Processing Times. IIE Transactions 39(5), 539–557 (2007)CrossRef
31.
Shabtay, D., Steiner, G.: A Survey of Scheduling with Controllable Processing Times. Discrete Applied Mathematics 155(13), 1643-1666 (2007)MATHCrossRefMathSciNet
32.
Shabtay, D., Bensoussan, Y.: Maximizing the Weighted Number of Just-in-Time Jobs in a Two Machine Flow and Open Shop Scheduling Systems. Journal of Scheduling, DOI: 10.1007/s10951-010-0204-y
33.
Shabtay, D., Bensusan, Y., Kaspi, M.: A Bicriteria Approach to Maximize the Weighted Number of Just-In-Time Jobs and to Minimize the Total Resource Consumption Cost in a Two-Machine Flow-Shop Scheduling System, International Journal of Production Economics, to appear
34.
Shakhlevich, N.V., Strusevich, V.A.: Pre-emptive Scheduling Problems with Controllable Processing Times. Journal of Scheduling 8, 233-253 (2005)MATHCrossRefMathSciNet
35.
36.
Sung, S.C., Vlach, M.:Maximizing Weighted Number of Just-in-Time Jobs on Unrelated Parallel Machines, Journal of Scheduling 8, 453-460 (2005)
37.
Trick, M.: Scheduling Multiple Variable-Speed Machines. Operations Research 42, 234-248 (1994)MATH
38.
Vickson, R.G.: Two Single Machine Sequencing Problems Involving Controllable Job Processing Times. AIIE Transactions 12(3), 258-262 (1980)CrossRefMathSciNet
39.
Yannakakis, M., Gavril, F.: The Maximum k-Colorable Subgraph Problem for Chordal Graphs. Information Processing Letters 24, 133-137 (1987)MATHCrossRefMathSciNet
Metadaten
Titel
Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey
verfasst von
Dvir Shabtay
George Steiner
Copyright-Jahr
2012
Verlag
Springer New York
Buch
Just-in-Time Systems

Print ISBN: 978-1-4614-1122-2

Electronic ISBN: 978-1-4614-1123-9

Copyright-Jahr: 2012

DOI
https://doi.org/10.1007/978-1-4614-1123-9_1