Semi-dynamic Demand in a Non-permutation Flowshop with Constrained Resequencing Buffers

No abstract is available for this paper.

• Publication year

  2009

• Venue

  Large-Scale Scientific Computing

• Publication date

  2009-03-26

• Fields of study

  Computer Science, Engineering

• Identifiers
  DOI 10.1007/978-3-540-78827-0_61
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Constraint Logic Programming

  2010cited by this paper
• A genetic algorithm for robotic assembly line balancing

  2006cited by this paper
• An effective hybrid genetic algorithm for flow shop scheduling with limited buffers

  2006cited by this paper
• Job-shop scheduling with limited capacity buffers

  2006cited by this paper
• Erratum to "Cycling in linear programming problems" [Computers and Operations Research 31 (2002) 303-311]

  2006cited by this paper
• Computational Science and Its Applications - ICCSA 2006, International Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part III

  2006cited by this paper
• A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility

  2006cited by this paper
• Performance Study of a Genetic Algorithm for Sequencing in Mixed Model Non-permutation Flowshops Using Constrained Buffers

  2006cited by this paper
• SEQUENCING IN MIXED MODEL NON-PERMUTATION FLOWSHOP PRODUCTION LINES USING CONSTRAINED BUFFERS

  2006cited by this paper
• A performance evaluation of permutation vs. non-permutation schedules in a flowshop

  2006cited by this paper
• Flow-shop scheduling for three serial stations with the last two duplicate

  2005cited by this paper
• Flow-shop problems with intermediate buffers

  2003cited by this paper
• Resequencing and feature assignment on an automated assembly line

  2003cited by this paper
• Job-shop scheduling with blocking and no-wait constraints

  2002cited by this paper
• The permutation flow shop with buffers: A tabu search approach

  1999cited by this paper
• A two-machine permutation flow shop scheduling problem with buffers

  1998cited by this paper
• Probabilistic Constraint Logic Programming

  1997cited by this paper
• Sequencing methods for automated storage and retrieval systems with dedicated storage

  1997cited by this paper
• Alternatives to line assembly: Some Swedish examples

  1996cited by this paper
• Genetic Algorithms + Data Structures = Evolution Programs

  1996cited by this paper
• Sequencing jobs on an automobile assembly line: objectives and procedures

  1994cited by this paper
• Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence

  1992cited by this paper
• Permutation vs. non-permutation flow shop schedules

  1991cited by this paper
• Flowshop sequencing problems with limited buffer storage

  1990cited by this paper
• A survey and evaluation of static flowshop scheduling heuristics

  1984cited by this paper
• Flowshop scheduling with limited temporary storage

  1980cited by this paper
• Note---Sequencing with Finite Intermediate Storage

  1976cited by this paper
• Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage

  1975cited by this paper
• Heuristische Verfahren zur Maschinenbelegungsplanung bei Reihenfertigung

  1975cited by this paper
• Genetic Algorithms and the Optimal Allocation of Trials

  1973cited by this paper

• The Non-Permutation Flow-Shop scheduling problem: A literature review

  2017cites this paper
• Heuristics for flow shop scheduling : considering non-permutation schedules and a heterogeneous workforce

  2015cites this paper