Skip to main content
SpringerLink
Log in

Flow shop non-idle scheduling and resource-constrained scheduling

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In a two-machine flow shop, the problem seeks to select and schedule jobs such that the processing of the selected jobs does not contain any idle time. The objective is to maximize the number of selected jobs. The problem is studied in the context of a resource-constrained scheduling problem. An \(O(n^2)\) dynamic programming algorithm is proposed. The problem becomes ordinary NP-hard when job weights are introduced. A heuristic is designed and its performance ratio is analysed to be 3.

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

Fig. 1

Similar content being viewed by others

References

  • Ausiello, G., Crescenzi, P., Kann, V., Marchetti-Spaccamela, A., & Protasi, M. (1999). Complexity and approximation: Combinatorial optimization problems and their approximability properties. New York: Springer.

    Book  Google Scholar 

  • Cheng, T. C. E., & Lin, B. M. T. (2009). Johnson’s rule, composite jobs and the relocation problem. European Journal of Operational Research, 192, 1008–1013.

  • Della Croce, F., Ghirardi, M., & Tadei, R. (2002). An improved branch-and-bound algorithm for the two machine total completion time flow shop problem. European Journal of Operational Research, 139, 293–301.

    Article  Google Scholar 

  • Della Croce, F., Narayan, V., & Tadei, R. (1996). The two-machine total completion time flow shop problem. European Journal of Operational Research, 90, 227–237.

    Article  Google Scholar 

  • Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1, 117–129.

  • Hoogeveen, J. A., & van de Velde, S. L. (1995). Stronger Lagrangean bounds by use of slack variables: Application to machine scheduling problems. Mathematical Programming, 70, 173–190.

    Google Scholar 

  • Ignall, E., & Schrage, J. (1965). Application of the branch-and-bound technique to some flow-shop scheduling problems. Operations Research, 13, 400–412.

    Article  Google Scholar 

  • Johnson, S. M. (1954). Optimal two and three-stage production schedules with setup times included. Naval Research Logistics Quarterly, 1, 61–68.

    Article  Google Scholar 

  • Kaplan, E. H. (1986). Relocation models for public housing redevelopment programs. Planning and Design, 13, 5–19.

    Article  Google Scholar 

  • Kaplan, E. H., & Amir, A. (1988). A fast feasibility test for relocation problems. European Journal of Operational Research, 35, 201–206.

  • Lin, B. M. T., & Wu, J. M. (2005). A simple lower bound for total completion time minimization in a two-machine flowshop. Asia Pacific Journal of Operational Research, 22, 391–407.

  • van de Velde, S. L. (1990). Minimizing the sum of job completion times in the two-machine flow-shop by Lagrangean relaxation. Annals of Operations Research, 26, 257–268.

    Google Scholar 

  • Xie, J.-X. (1997). Polynomial algorithms for single machine scheduling problems with financial constraints. Operations Research Letters, 21, 39–42.

    Article  Google Scholar 

Download references

Acknowledgments

The author is grateful to the anonymous reviewers for their constructive comments. This research was supported in part by the Ministry of Science and Technology of Taiwan under Grants MOST-102-2923-H-009-001-MY3 and MOST-102-2410-H-009-048-MY2.

Author information

Authors and Affiliations

  1. Department of Information Management and Finance, Institute of Information Management, National Chiao Tung University, Hsinchu, 300, Taiwan

    Yen-Shing Tsai & Bertrand M. T. Lin

  2. Department of Computer Science and Information Engineering, National United University, Miaoli, 360, Taiwan

    Yen-Shing Tsai

Authors
  1. Yen-Shing Tsai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bertrand M. T. Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bertrand M. T. Lin.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Tsai, YS., Lin, B.M.T. Flow shop non-idle scheduling and resource-constrained scheduling. Ann Oper Res 238, 577–585 (2016). https://doi.org/10.1007/s10479-015-2070-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-015-2070-7

Keywords

Search

Navigation