Skip to main content
SpringerLink
Log in

Performance analysis of active schedules in identical parallel machine

  • Published:
Journal of Control Theory and Applications Aims and scope Submit manuscript

Abstract

Active schedule is one of the most basic and popular concepts in production scheduling research. For identical parallel machine scheduling with jobs’ dynamic arrivals, the tight performance bounds of active schedules under the measurement of four popular objectives are respectively given in this paper. Similar analysis method and conclusions can be generalized to static identical parallel machine and single machine scheduling problem.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. R. Bellman, A. O. Esogbue, I. Nabeshima. Mathematical Aspects of Scheduling and Applications[M]. Oxford: Pergamon Press, 1982.

    Google Scholar 

  2. A. H. G. Kan Rinnooy. Machine Scheduling Problems: Classification, Complexity and Computations[M]. Hague: Martinus Nijhoff, 1976.

    Google Scholar 

  3. J. Riezebos, G. J. C. Gaalman. Time lag size in multiple operations flow shop scheduling heuristics[J]. European Journal of Operational Research, 1998, 105(1): 72–90.

    Article  MATH  Google Scholar 

  4. K. Fleszar, K. S. Hindi. Solving the resource-constrained project scheduling problem by a variable neighbourhood search[J]. European Journal of Operational Research, 2004, 115(2): 402–413.

    Article  MathSciNet  Google Scholar 

  5. C. Chekuri, S. Khanna. Approximation algorithms for minimizing average weighted completion time[M]//Handbook of Scheduling: Algorithms, Models, and Performance Analysis. Florida: CRC Press, 2004.

    Google Scholar 

  6. L. A. Hall, A. S. Schulz, D. B. Shmoys, et al. Scheduling to minimize average completion time: off-line and online approximation algorithms[J]. Mathematics of Operations Research, 1997, 22(3): 513–544.

    Article  MATH  MathSciNet  Google Scholar 

  7. C. Wang, Y. Xi. A Rolling Optimization algorithm based on collision window for single machine scheduling problem[J]. Journal of Systems Engineering and Electronics, 2005, 16(4): 816–822.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Automation, Shanghai Jiao Tong University, Shanghai, 200240, China

    Changjun Wang & Yugeng Xi

Authors
  1. Changjun Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yugeng Xi
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This work was supported by the National Natural Science Foundation of China (No. 60474002, 60504026) and Shanghai Development Foundation for Science and Technology (No. 04DZ11008).

Changjun WANG is a Ph.D. candidate in Shanghai Jiao Tong University. He received his M.S. degree from Shanghai University in 2002. His research interests include scheduling and control of production plan.

Yugeng XI is a professor of Shanghai Jiao Tong University. He received his Ph.D. degree from Technical University of Munich, Germany in 1984. His research interests include predictive control, large-scale system, and intelligent robotics.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, C., Xi, Y. Performance analysis of active schedules in identical parallel machine. J. Control Theory Appl. 5, 239–243 (2007). https://doi.org/10.1007/s11768-005-5071-2

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11768-005-5071-2

Keywords

Search

Navigation