Permutation flow shop scheduling with makespan objective and truncated learning effects

DOI10.1007/S12190-024-02080-WzbMATH Open1545.90074MaRDI QIDQ6586108

Dan-Yang Lv, Ji-Bo Wang, Li-Han Zhang, Ming-Hui Li

Publication date: 12 August 2024

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

zbMATH Keywords

schedulingsimulated annealingtabu searchbranch-and-boundflow shoplearning effect

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects
• A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
• A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects
• Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times
• A note on the total completion time problem in a permutation flowshop with a learning effect
• The single-machine total weighted tardiness scheduling problem with position-based learning effects
• Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects
• Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights
• Improved algorithms for proportionate flow shop scheduling with due-window assignment
• Single-machine scheduling problems with general truncated sum-of-actual-processing-time-based learning effect
• Scheduling jobs with general truncated learning effects including proportional setup times
• Flow shops with reentry: reversibility properties and makespan optimal schedules
• Resource allocation flowshop scheduling with learning effect and slack due window assignment
• Heuristic and exact algorithms for single-machine scheduling problems with general truncated learning effects
• Research on position-dependent weights scheduling with delivery times and truncated sum-of-processing-times-based learning effect
• The Complexity of Flowshop and Jobshop Scheduling
• Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect
• Scheduling with a position-weighted learning effect and job release dates
• Flow Shop Resource Allocation Scheduling with Due Date Assignment, Learning Effect and Position-Dependent Weights
• Parallel-Machine Scheduling with Step-Deteriorating Jobs to Minimize the Total (Weighted) Completion Time
• Research on m‐machine flow shop scheduling with truncated learning effects
• Optimization of scheduling problems with deterioration effects and an optional maintenance activity
• Single machine slack due window assignment and deteriorating jobs
• Research on delivery times scheduling with truncated learning effects
• Minmax common due-window assignment scheduling with deteriorating jobs

Related Items (2)

A two-agent resource allocation scheduling problem with slack due-date assignment and general deterioration function ⋮ Single-machine group scheduling with general linear deterioration and truncated learning effects

This page was built for publication: Permutation flow shop scheduling with makespan objective and truncated learning effects

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6586108)