Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 7-Day Trial for You or Your Team.

Learn More →

Comparing scheduling rules for flexible flow lines

Comparing scheduling rules for flexible flow lines http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Production Economics CrossRef

Comparing scheduling rules for flexible flow lines

Kurz, Mary E.; Askin, Ronald G.
International Journal of Production Economics , Volume 85 (3): 371-388 – Sep 1, 2003
Download PDF

Comparing scheduling rules for flexible flow lines

Kurz, Mary E.; Askin, Ronald G.
International Journal of Production Economics , Volume 85 (3): 371-388 – Sep 1, 2003

Loading next page...
 
/lp/crossref/comparing-scheduling-rules-for-flexible-flow-lines-Kf3TPVAdE5

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
CrossRef
ISSN
0925-5273
DOI
10.1016/s0925-5273(03)00123-3
Publisher site
See Article on Publisher Site

Abstract

Journal

International Journal of Production Economics – CrossRef

Published: Sep 1, 2003

References

  • Scheduling of flexible flow lines in an automobile assembly plant
    Agnetis
  • Branch and bound algorithm for the flow shop with multiple processors
    Brah
  • Heuristics for scheduling in a flow shop with multiple processors
    Brah
  • A heuristic algorithm for the n job, m machine sequencing problem
    Campbell
  • Heuristics for scheduling flexible flow lines
    Ding
  • A flowshop scheduling problem with two operations per job
    Gupta
  • Optimal two- and three-stage production schedules with setup times included
    Johnson
  • Heuristic methods for flexible flow line scheduling
    Kochhar
  • Heuristic scheduling of parallel machines with sequence-dependent set-up times
    Kurz
  • Note on “An adaptable problem-space-based search method for flexible flow line scheduling”
    Kurz
  • Minimizing makespan in hybrid flowshops
    Lee
  • A genetic algorithm-based approach to flexible flow-line scheduling with variable lot sizes
    Lee
  • An adaptable problem-space-based search method for flexible flow line scheduling
    Leon
  • A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem
    Nawaz
  • An approximation algorithm for a single-machine scheduling problem with release times and delivery times
    Nowicki
  • A fast tabu search algorithm for the permutation flow-shop problem
    Nowicki
  • The flow shop with parallel machines
    Nowicki
  • Two-stage flowshop scheduling with a common second-stage machine
    Oguz
  • Learning-based scheduling in a flexible manufacturing flow line
    Piramuthu
  • Scheduling in n-job, m-stage flowshop with parallel processors to minimize makespan
    Rajendran
  • A hybrid three-stage flowshop problem
    Riane
  • Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups
    Rios-Mercado
  • A solution to a special case of flow shop scheduling problems
    Salvador
  • FLOWMULT
    Santos
  • An evaluation of sequencing heuristics in flow shops with multiple processors
    Santos