Lagrangian relaxation for the permutation flowshop scheduling problem with minimal and maximal time lags

No abstract is available for this paper.

• Publication year

  2014

• Venue

  International Conference on Control, Decision and Information Technologies

• Publication date

  2014-12-29

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1109/CoDIT.2014.6996865
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Lagrangian relaxation and cut generation for sequence-dependent setup time flowshop scheduling problems to minimise the total weighted tardiness

  2013cited by this paper
• Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness

  2010cited by this paper
• Permutation flowshop scheduling problems with maximal and minimal time lags

  2006cited by this paper
• A branch and bound algorithm to minimize the total tardiness for m

  2006cited by this paper
• Scheduling operations for the harvesting of renewable resources

  2005cited by this paper
• Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard

  2004cited by this paper
• Single Machine Scheduling with Chain Structured Precedence Constraints and Separation Time Windows

  2004cited by this paper
• Shop Problems With Two Machines and Time Lags

  1996cited by this paper
• Scheduling permutation flow shops using the Lagrangian relaxation technique

  1996influential reference
• Scheduling: Theory, Algorithms, and Systems

  1994cited by this paper
• Scheduling products with bills of materials using an improved Lagrangian relaxation technique

  1994cited by this paper
• The Total Tardiness Problem: Review and Extensions

  1994cited by this paper
• Scheduling of manufacturing systems using the Lagrangian relaxation technique

  1991cited by this paper
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

  1977cited by this paper
• Introduction to sequencing and scheduling

  1974cited by this paper

• Permutation flowshop scheduling to obtain the optimal solution/a lower bound with the makespan objective

  2020cites this paper
• Permutation flowshop scheduling to obtain the optimal solution/a lower bound with the makespan objective

  2020cites this paper