IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v149y2003i3p533-539.html
   My bibliography  Save this article

Complexity and approximability results for slicing floorplan designs

Author

Listed:
  • Deineko, Vladimir G.
  • Woeginger, Gerhard J.

Abstract

No abstract is available for this item.

Suggested Citation

  • Deineko, Vladimir G. & Woeginger, Gerhard J., 2003. "Complexity and approximability results for slicing floorplan designs," European Journal of Operational Research, Elsevier, vol. 149(3), pages 533-539, September.
    • Handle: RePEc:eee:ejores:v:149:y:2003:i:3:p:533-539
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(02)00527-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. Almeida, A. M. C. & Martins, Ernesto Q. V. & Rodrigues, Rosalia D., 1998. "Optimal cutting directions and rectangle orientation algorithm," European Journal of Operational Research, Elsevier, vol. 109(3), pages 660-671, September.
    2. Gerhard J. Woeginger, 2000. "When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?," INFORMS Journal on Computing, INFORMS, vol. 12(1), pages 57-74, February.
    Full references (including those not matched with items on IDEAS)

    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. Du-Juan Wang & Yunqiang Yin & Shuenn-Ren Cheng & T.C.E. Cheng & Chin-Chia Wu, 2016. "Due date assignment and scheduling on a single machine with two competing agents," International Journal of Production Research, Taylor & Francis Journals, vol. 54(4), pages 1152-1169, February.
    2. Yunqiang Yin & Doudou Li & Dujuan Wang & T. C. E. Cheng, 2021. "Single-machine serial-batch delivery scheduling with two competing agents and due date assignment," Annals of Operations Research, Springer, vol. 298(1), pages 497-523, March.
    3. Feng Li & Zhou Xu & Zhi-Long Chen, 2020. "Production and Transportation Integration for Commit-to-Delivery Mode with General Shipping Costs," INFORMS Journal on Computing, INFORMS, vol. 32(4), pages 1012-1029, October.
    4. Khaled Elbassioni & Areg Karapetyan & Trung Thanh Nguyen, 2019. "Approximation schemes for r-weighted Minimization Knapsack problems," Annals of Operations Research, Springer, vol. 279(1), pages 367-386, August.
    5. Dujuan Wang & Yunqiang Yin & T.C.E. Cheng, 2017. "A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(1), pages 41-63, February.
    6. Sterna, Malgorzata, 2011. "A survey of scheduling problems with late work criteria," Omega, Elsevier, vol. 39(2), pages 120-129, April.
    7. Berlińska, Joanna & Przybylski, Bartłomiej, 2021. "Scheduling for gathering multitype data with local computations," European Journal of Operational Research, Elsevier, vol. 294(2), pages 453-459.
    8. Nir Halman, 2020. "Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs," INFORMS Journal on Computing, INFORMS, vol. 32(4), pages 1157-1181, October.
    9. Yunqiang Yin & Yongjian Yang & Dujuan Wang & T.C.E. Cheng & Chin‐Chia Wu, 2018. "Integrated production, inventory, and batch delivery scheduling with due date assignment and two competing agents," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(5), pages 393-409, August.
    10. Jan Karel Lenstra & Franz Rendl & Frits Spieksma & Marc Uetz, 2022. "In memoriam Gerhard Woeginger," Journal of Scheduling, Springer, vol. 25(5), pages 503-505, October.
    11. Justkowiak, Jan-Erik & Kovalev, Sergey & Kovalyov, Mikhail Y. & Pesch, Erwin, 2023. "Single machine scheduling with assignable due dates to minimize maximum and total late work," European Journal of Operational Research, Elsevier, vol. 308(1), pages 76-83.
    12. Hans Kellerer & Vitaly A. Strusevich, 2016. "Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications," Annals of Operations Research, Springer, vol. 240(1), pages 39-94, May.
    13. Elisabeth Günther & Felix G. König & Nicole Megow, 2014. "Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width," Journal of Combinatorial Optimization, Springer, vol. 27(1), pages 164-181, January.
    14. Halman, Nir & Kellerer, Hans & Strusevich, Vitaly A., 2018. "Approximation schemes for non-separable non-linear boolean programming problems under nested knapsack constraints," European Journal of Operational Research, Elsevier, vol. 270(2), pages 435-447.
    15. Christoph Hertrich & Martin Skutella, 2023. "Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size," INFORMS Journal on Computing, INFORMS, vol. 35(5), pages 1079-1097, September.
    16. Yongjian Yang & Guangqiang Yin & Chunyu Wang & Yunqiang Yin, 0. "Due date assignment and two-agent scheduling under multitasking environment," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-17.
    17. Retel Helmrich, Mathijn J. & Jans, Raf & van den Heuvel, Wilco & Wagelmans, Albert P.M., 2015. "The economic lot-sizing problem with an emission capacity constraint," European Journal of Operational Research, Elsevier, vol. 241(1), pages 50-62.
    18. Helmut A. Sedding, 2020. "Scheduling jobs with a V-shaped time-dependent processing time," Journal of Scheduling, Springer, vol. 23(6), pages 751-768, December.
    19. Xin Chen & Malgorzata Sterna & Xin Han & Jacek Blazewicz, 2016. "Scheduling on parallel identical machines with late work criterion: Offline and online cases," Journal of Scheduling, Springer, vol. 19(6), pages 729-736, December.
    20. Koulamas, Christos, 2020. "The proportionate flow shop total tardiness problem," European Journal of Operational Research, Elsevier, vol. 284(2), pages 439-444.

    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:ejores:v:149:y:2003:i:3:p:533-539. 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/eor .

    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.