Several flow shop scheduling problems with truncated position-based learning effect

DOI10.1016/j.cor.2013.07.001zbMath1348.90323OpenAlexW1980068162MaRDI QIDQ336658

Mohammad Hasan, M. Dambrine

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.07.001

zbMATH Keywords

schedulingflow shopheuristic algorithmworst-case analysislearning effectregular performance criteria

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects, Single-machine group scheduling with processing times dependent on position, starting time and allotted resource, Proportionate flowshop scheduling with position-dependent weights, Flowshop scheduling with a general exponential learning effect, Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects, Scheduling on parallel processors with varying processing times, Scheduling with job-splitting considering learning and the vital-few law, An order scheduling problem with position-based learning effect, Tri-criteria single machine scheduling model with release times and learning factor, Research on m‐machine flow shop scheduling with truncated learning effects, Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry, An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects, Bicriterion optimization for flow shop with a learning effect subject to release dates, Scheduling with job-rejection and position-dependent processing times on proportionate flowshops, Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects, Research on single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs, Single-machine scheduling problems with general truncated sum-of-actual-processing-time-based learning effect, Due date assignment scheduling with positional-dependent weights and proportional setup times, An Optimal Online Algorithm for Scheduling with Learning Consideration, Scheduling problems with effects of deterioration and truncated job-dependent learning

Cites Work

• Unnamed Item
• Unnamed Item
• Scheduling with general position-based learning curves
• Scheduling on parallel identical machines with job-rejection and position-dependent processing times
• Total absolute deviation of job completion times on uniform and unrelated machines
• Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects
• Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations
• Single-machine and two-machine flowshop scheduling with general learning functions
• A note on the total completion time problem in a permutation flowshop with a learning effect
• A bicriteria flowshop scheduling with a learning effect
• Single-machine scheduling problems with a learning effect
• Single-machine scheduling with learning considerations
• An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
• Some results of the worst-case analysis for flow shop scheduling
• A heuristic algorithm for mean flowtime objective in flowshop scheduling
• Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times
• Proportionate flowshops with general position-dependent processing times
• A state-of-the-art review on scheduling with learning effects
• Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases
• Flow-shop scheduling with a learning effect
• A due-window assignment problem with position-dependent processing times
• Flowshop and Jobshop Schedules: Complexity and Approximation
• The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Single machine scheduling with learning effect considerations