Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects
From MaRDI portal
Publication:2008062
DOI10.1007/s12190-019-01255-0zbMath1425.90048OpenAlexW2929137789MaRDI QIDQ2008062
Ji-Bo Wang, Xue Huang, Na Yin, Bo Zhang, Xi-Xi Liang
Publication date: 22 November 2019
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-019-01255-0
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (8)
Single-machine due-date assignment scheduling with generalized earliness-tardiness penalties including proportional setup times ⋮ Heuristic and exact algorithms for single-machine scheduling problems with general truncated learning effects ⋮ Solution algorithms for single-machine scheduling with learning effects and exponential past-sequence-dependent delivery times ⋮ Resource dependent scheduling with truncated learning effects ⋮ Research on delivery times scheduling with truncated learning effects ⋮ Research on position-dependent weights scheduling with delivery times and truncated sum-of-processing-times-based learning effect ⋮ Single-machine scheduling problems with the general sum-of-processing-time and position-dependent effect function ⋮ Due-window assignment scheduling with learning and deterioration effects
Cites Work
- Unnamed Item
- Several flow shop scheduling problems with truncated position-based learning effect
- Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects
- A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects
- Makespan minimization in machine dominated flowshop
- Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
- Single machine scheduling with multiple common due date assignment and aging effect under a deteriorating maintenance activity consideration
- Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects
- A bicriteria parallel machine scheduling with a learning effect of setup and removal times
- Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations
- Single-machine scheduling with learning considerations
- Some results of the worst-case analysis for flow shop scheduling
- Single machine due window assignment resource allocation scheduling with job-dependent learning effect
- The single-machine total weighted tardiness scheduling problem with position-based learning effects
- Bicriterion scheduling with group technology and deterioration effect
- Deteriorating jobs scheduling on a single machine with release dates, rejection and a fixed non-availability interval
- Scheduling problems with effects of deterioration and truncated job-dependent learning
- Some scheduling problems with general position-dependent and time-dependent learning effects
- Research on permutation flow shop scheduling problems with general position-dependent learning effects
- Some results of the worst-case analysis for flow shop scheduling with a learning effect
- A state-of-the-art review on scheduling with learning effects
- Single machine scheduling problems with general position-dependent processing times and past-sequence-dependent delivery times
- Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases
- Flow-shop scheduling with a learning effect
- 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
- Research on m‐machine flow shop scheduling with truncated learning effects
This page was built for publication: Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects