Skip to main content

and
  1. No Access

    Article

    Reentrant two-stage multiprocessor flow shop scheduling with due windows

    Reentrant flow shop scheduling allows a job to revisit a particular machine several times. The topic has received considerable interest in recent years; with related studies demonstrating that particle swarm a...

    Rong-Hwa Huang, Shun-Chi Yu, Chen-Wei Kuo in The International Journal of Advanced Manu… (2014)

  2. No Access

    Article

    Hybrid decision model for information project selection

    Information project selection is an important and recurring activity in many organizations. Establishing a systematic project selection model thus is important for organizations. However, information system pr...

    Chang-Lin Yang, Sue-Jane Chiang, Rong-Hwa Huang, Yu-An Lin in Quality & Quantity (2013)

  3. No Access

    Article

    No-wait two-stage multiprocessor flow shop scheduling with unit setup

    A well-arranged production schedule enhances equipment utility rate by distributing limited resources properly, which also improves efficiency and reduces costs. No-wait operations are among the most common pr...

    Rong-Hwa Huang, Chang-Lin Yang in The International Journal of Advanced Manu… (2009)

  4. No Access

    Article

    Solving a multi-objective overlap** flow-shop scheduling

    In flow-shop manufacturing scheduling systems, managers attempt to minimize makespan and manufacturing costs. Job overlaps are typically unavoidable in real-life applications as overlap** production shortens...

    Rong-Hwa Huang, Chang-Lin Yang in The International Journal of Advanced Manu… (2009)

  5. No Access

    Article

    Ant colony system for job shop scheduling with time windows

    Scheduling for a job shop production system is an integral aspect of production management. Scheduling operations must minimize stock, waste, and idle time and ensure on-time delivery of goods in a time window...

    Rong-Hwa Huang, Chang-Lin Yang in The International Journal of Advanced Manu… (2008)

  6. No Access

    Article

    An Algorithm for Minimizing the Range of Lateness on a Single Machine

    This paper considers the problem of minimizing the range of lateness on a single machine. All the algorithms in the literature for solving this problem are based on the branch-and-bound approach, which has an ...

    Ching-Jong Liao, Rong-Hwa Huang in Journal of the Operational Research Society (1991)