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

Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date

Author

Listed:
  • Sung, C. S.
  • Min, J. I.

Abstract

No abstract is available for this item.

Suggested Citation

  • Sung, C. S. & Min, J. I., 2001. "Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date," European Journal of Operational Research, Elsevier, vol. 131(1), pages 95-106, May.
    • Handle: RePEc:eee:ejores:v:131:y:2001:i:1:p:95-106
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(99)00447-6
    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. Kenneth R. Baker & Gary D. Scudder, 1990. "Sequencing with Earliness and Tardiness Penalties: A Review," Operations Research, INFORMS, vol. 38(1), pages 22-36, February.
    2. Alidaee, Bahram & Dragan, Irinel, 1997. "A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date," European Journal of Operational Research, Elsevier, vol. 96(3), pages 559-563, February.
    3. Nicholas G. Hall & Marc E. Posner, 1991. "Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date," Operations Research, INFORMS, vol. 39(5), pages 836-846, October.
    4. Javad H. Ahmadi & Reza H. Ahmadi & Sriram Dasu & Christopher S. Tang, 1992. "Batching and Scheduling Jobs on Batch and Discrete Processors," Operations Research, INFORMS, vol. 40(4), pages 750-763, August.
    5. Unknown, 1986. "Letters," Choices: The Magazine of Food, Farm, and Resource Issues, Agricultural and Applied Economics Association, vol. 1(4), pages 1-9.
    6. Nicholas G. Hall & Wieslaw Kubiak & Suresh P. Sethi, 1991. "Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date," Operations Research, INFORMS, vol. 39(5), pages 847-856, October.
    7. Scott Webster & Kenneth R. Baker, 1995. "Scheduling Groups of Jobs on a Single Machine," Operations Research, INFORMS, vol. 43(4), pages 692-703, August.
    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. Toktas, Berkin & Azizoglu, Meral & Koksalan, Suna Kondakci, 2004. "Two-machine flow shop scheduling with two criteria: Maximum earliness and makespan," European Journal of Operational Research, Elsevier, vol. 157(2), pages 286-295, September.
    2. Cheng, Ba-Yi & Leung, Joseph Y-T. & Li, Kai, 2017. "Integrated scheduling on a batch machine to minimize production, inventory and distribution costs," European Journal of Operational Research, Elsevier, vol. 258(1), pages 104-112.
    3. Vacharapoom Benjaoran & Nashwan Dawood & Brian Hobbs, 2005. "Flowshop scheduling model for bespoke precast concrete production planning," Construction Management and Economics, Taylor & Francis Journals, vol. 23(1), pages 93-105.
    4. Kerem Bülbül & Philip Kaminsky & Candace Yano, 2004. "Flow shop scheduling with earliness, tardiness, and intermediate inventory holding costs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(3), pages 407-445, April.
    5. Moslehi, G. & Mirzaee, M. & Vasei, M. & Modarres, M. & Azaron, A., 2009. "Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness," International Journal of Production Economics, Elsevier, vol. 122(2), pages 763-773, December.
    6. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    7. G Mosheiov, 2003. "Scheduling unit processing time jobs on an m-machine flow-shop," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(4), pages 437-441, April.

    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. Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, December.
    2. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    3. Mosheiov, Gur & Shadmon, Michal, 2001. "Minmax earliness-tardiness costs with unit processing time jobs," European Journal of Operational Research, Elsevier, vol. 130(3), pages 638-652, May.
    4. Zhi-Long Chen, 1997. "Scheduling with batch setup times and earliness-tardiness penalties," European Journal of Operational Research, Elsevier, vol. 96(3), pages 518-537, February.
    5. Feng Li & Zhi-Long Chen & Zhi-Long Chen, 2017. "Integrated Production, Inventory and Delivery Problems: Complexity and Algorithms," INFORMS Journal on Computing, INFORMS, vol. 29(2), pages 232-250, May.
    6. Francis Sourd, 2009. "New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling," INFORMS Journal on Computing, INFORMS, vol. 21(1), pages 167-175, February.
    7. Mosheiov, Gur, 2004. "Simultaneous minimization of total completion time and total deviation of job completion times," European Journal of Operational Research, Elsevier, vol. 157(2), pages 296-306, September.
    8. Lin, Shih-Wei & Chou, Shuo-Yan & Ying, Kuo-Ching, 2007. "A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date," European Journal of Operational Research, Elsevier, vol. 177(2), pages 1294-1301, March.
    9. Ventura, Jose A. & Kim, Daecheol & Garriga, Frederic, 2002. "Single machine earliness-tardiness scheduling with resource-dependent release dates," European Journal of Operational Research, Elsevier, vol. 142(1), pages 52-69, October.
    10. Chen, Wei-Yang & Sheen, Gwo-Ji, 2007. "Single-machine scheduling with multiple performance measures: Minimizing job-dependent earliness and tardiness subject to the number of tardy jobs," International Journal of Production Economics, Elsevier, vol. 109(1-2), pages 214-229, September.
    11. Cai, X., 1996. "V-shape property for job sequences that minimize the expected completion time variance," European Journal of Operational Research, Elsevier, vol. 91(1), pages 118-123, May.
    12. Chung Keung Poon & Wenci Yu, 2005. "On-Line Scheduling Algorithms for a Batch Machine with Finite Capacity," Journal of Combinatorial Optimization, Springer, vol. 9(2), pages 167-186, March.
    13. Biskup, Dirk & Feldmann, Martin, 2005. "On scheduling around large restrictive common due windows," European Journal of Operational Research, Elsevier, vol. 162(3), pages 740-761, May.
    14. Gordon, Valery & Proth, Jean-Marie & Chu, Chengbin, 2002. "A survey of the state-of-the-art of common due date assignment and scheduling research," European Journal of Operational Research, Elsevier, vol. 139(1), pages 1-25, May.
    15. Koulamas, Christos & Kyparisis, George J., 2023. "A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems," European Journal of Operational Research, Elsevier, vol. 305(3), pages 999-1017.
    16. Alidaee, Bahram & Dragan, Irinel, 1997. "A note on minimizing the weighted sum of tardy and early completion penalties in a single machine: A case of small common due date," European Journal of Operational Research, Elsevier, vol. 96(3), pages 559-563, February.
    17. Baker, Kenneth R., 2014. "Minimizing earliness and tardiness costs in stochastic scheduling," European Journal of Operational Research, Elsevier, vol. 236(2), pages 445-452.
    18. Chhajed, Dilip, 1995. "A fixed interval due-date scheduling problem with earliness and due-date costs," European Journal of Operational Research, Elsevier, vol. 84(2), pages 385-401, July.
    19. Sung, C. S. & Choung, Y. I., 2000. "Minimizing makespan on a single burn-in oven in semiconductor manufacturing," European Journal of Operational Research, Elsevier, vol. 120(3), pages 559-574, February.
    20. X. Cai & F. S. Tu, 1996. "Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early‐tardy penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(8), pages 1127-1146, December.

    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:131:y:2001:i:1:p:95-106. 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.