IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v66y2000i1p53-57.html
   My bibliography  Save this article

Solvable cases of permutation flowshop scheduling with dominating machines

Author

Listed:
  • Xiang, S.
  • Tang, G.
  • Cheng, T. C. E.

Abstract

No abstract is available for this item.

Suggested Citation

  • Xiang, S. & Tang, G. & Cheng, T. C. E., 2000. "Solvable cases of permutation flowshop scheduling with dominating machines," International Journal of Production Economics, Elsevier, vol. 66(1), pages 53-57, June.
    • Handle: RePEc:eee:proeco:v:66:y:2000:i:1:p:53-57
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(99)00106-1
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. J. Michael Moore, 1968. "An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs," Management Science, INFORMS, vol. 15(1), pages 102-109, September.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Cheng, MingBao & Sun, ShiJie & He, LongMin, 2007. "Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines," European Journal of Operational Research, Elsevier, vol. 183(1), pages 115-124, November.
    2. J-B Wang & Z-Q Xia, 2006. "Flow shop scheduling problems with deteriorating jobs under dominating machines," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(2), pages 220-226, February.
    3. Sun, Lin-Hui & Sun, Lin-Yan & Wang, Ming-Zheng & Wang, Ji-Bo, 2012. "Flow shop makespan minimization scheduling with deteriorating jobs under dominating machines," International Journal of Production Economics, Elsevier, vol. 138(1), pages 195-200.
    4. Ruiz-Torres, Alex J. & Ho, Johnny C. & Ablanedo-Rosas, José H., 2011. "Makespan and workstation utilization minimization in a flowshop with operations flexibility," Omega, Elsevier, vol. 39(3), pages 273-282, June.
    5. Wang, Ji-Bo & Xia, Zun-Quan, 2006. "Flow shop scheduling with deteriorating jobs under dominating machines," Omega, Elsevier, vol. 34(4), pages 327-336, August.
    6. Lee, Wen-Chiung & Wu, Chin-Chia, 2004. "Minimizing total completion time in a two-machine flowshop with a learning effect," International Journal of Production Economics, Elsevier, vol. 88(1), pages 85-93, March.
    7. J-B Wang & Z-Q Xia, 2005. "Flow-shop scheduling with a learning effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(11), pages 1325-1330, November.
    8. Waldherr, Stefan & Knust, Sigrid, 2015. "Complexity results for flow shop problems with synchronous movement," European Journal of Operational Research, Elsevier, vol. 242(1), pages 34-44.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ben-Daya, M. & Duffuaa, S. O. & Raouf, A., 1996. "Minimizing mean tardiness subject to unspecified minimum number tardy for a single machine," European Journal of Operational Research, Elsevier, vol. 89(1), pages 100-107, February.
    2. Gupta, Jatinder N. D. & Ho, Johnny C., 1996. "Scheduling with two job classes and setup times to minimize the number of tardy jobs," International Journal of Production Economics, Elsevier, vol. 42(3), pages 205-216, April.
    3. Chen, Bo & Zhang, Xiandong, 2019. "Scheduling with time-of-use costs," European Journal of Operational Research, Elsevier, vol. 274(3), pages 900-908.
    4. Nicholas G. Hall & Marc E. Posner & Chris N. Potts, 2021. "Online production planning to maximize the number of on-time orders," Annals of Operations Research, Springer, vol. 298(1), pages 249-269, March.
    5. Rubing Chen & Jinjiang Yuan, 2020. "Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices," 4OR, Springer, vol. 18(2), pages 177-196, June.
    6. Jinjiang Yuan, 2017. "Unary NP-hardness of minimizing the number of tardy jobs with deadlines," Journal of Scheduling, Springer, vol. 20(2), pages 211-218, April.
    7. Talla Nobibon, Fabrice & Leus, Roel & Nip, Kameng & Wang, Zhenbo, 2015. "Resource loading with time windows," European Journal of Operational Research, Elsevier, vol. 244(2), pages 404-416.
    8. Jasper Jong & Marc Uetz, 2020. "The quality of equilibria for set packing and throughput scheduling games," International Journal of Game Theory, Springer;Game Theory Society, vol. 49(1), pages 321-344, March.
    9. Murat Güngör, 2016. "A note on efficient sequences with respect to total flow time and number of tardy jobs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(4), pages 346-348, June.
    10. Janiak, Adam & Krysiak, Tomasz, 2012. "Scheduling jobs with values dependent on their completion times," International Journal of Production Economics, Elsevier, vol. 135(1), pages 231-241.
    11. Klaus Heeger & Danny Hermelin & George B. Mertzios & Hendrik Molter & Rolf Niedermeier & Dvir Shabtay, 2023. "Equitable scheduling on a single machine," Journal of Scheduling, Springer, vol. 26(2), pages 209-225, April.
    12. Erenay, Fatih Safa & Sabuncuoglu, Ihsan & Toptal, Aysegül & Tiwari, Manoj Kumar, 2010. "New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs," European Journal of Operational Research, Elsevier, vol. 201(1), pages 89-98, February.
    13. Ruyan He & Jinjiang Yuan & C. T. Ng & T. C. E. Cheng, 2021. "Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work," Journal of Combinatorial Optimization, Springer, vol. 41(2), pages 504-525, February.
    14. Schmidt, Gunter, 2000. "Performance guarantee of two simple priority rules for production scheduling," International Journal of Production Economics, Elsevier, vol. 68(2), pages 151-159, November.
    15. Julia Chuzhoy & Rafail Ostrovsky & Yuval Rabani, 2006. "Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems," Mathematics of Operations Research, INFORMS, vol. 31(4), pages 730-738, November.
    16. Sevaux, Marc & Dauzere-Peres, Stephane, 2003. "Genetic algorithms to minimize the weighted number of late jobs on a single machine," European Journal of Operational Research, Elsevier, vol. 151(2), pages 296-306, December.
    17. Baptiste, Philippe & Peridy, Laurent & Pinson, Eric, 2003. "A branch and bound to minimize the number of late jobs on a single machine with release time constraints," European Journal of Operational Research, Elsevier, vol. 144(1), pages 1-11, January.
    18. Potts, Chris N. & Kovalyov, Mikhail Y., 2000. "Scheduling with batching: A review," European Journal of Operational Research, Elsevier, vol. 120(2), pages 228-249, January.
    19. Biskup, Dirk & Herrmann, Jan, 2008. "Single-machine scheduling against due dates with past-sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 191(2), pages 587-592, December.
    20. Yuan, Jinjiang & Lin, Yixun, 2005. "Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria," European Journal of Operational Research, Elsevier, vol. 164(3), pages 851-855, August.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:proeco:v:66:y:2000:i:1:p:53-57. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.