Research on permutation flow shop scheduling problems with general position-dependent learning effects
From MaRDI portal
Publication:2449372
DOI10.1007/s10479-013-1481-6zbMath1286.90066OpenAlexW2050253650MaRDI QIDQ2449372
Kai Cui, Ju-Hong Chen, Xian-Chen He, Jun Wang, Lin-Hui Sun
Publication date: 8 May 2014
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-013-1481-6
Related Items (13)
Due-window assignment scheduling in the proportionate flow shop setting ⋮ Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation ⋮ Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect ⋮ Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects ⋮ An order scheduling problem with position-based learning effect ⋮ Scheduling jobs families with learning effect on the setup ⋮ Research on m‐machine flow shop scheduling with truncated learning effects ⋮ Bicriterion optimization for flow shop with a learning effect subject to release dates ⋮ A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection ⋮ Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects ⋮ Single machine group scheduling with time dependent processing times and ready times ⋮ Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads ⋮ Scheduling problems with effects of deterioration and truncated job-dependent learning
Cites Work
- Unnamed Item
- Scheduling jobs with a general learning effect model
- Depth-first heuristic search for the job shop scheduling problem
- An iterative approach for the serial batching problem with parallel machines and job families
- Strong NP-hardness of scheduling problems with learning or aging effect
- Routing and scheduling in project shipping
- Single machine total tardiness maximization problems: complexity and algorithms
- Scheduling with general position-based learning curves
- Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect
- 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
- Single-machine scheduling problems with time and position dependent processing times
- Single machine scheduling with total tardiness criterion and convex controllable processing times
- 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
- The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times
- Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem
- On the geometry, preemptions and complexity of multiprocessor and shop scheduling
- A note on the total completion time problem in a permutation flowshop with a learning effect
- Some results of the worst-case analysis for flow shop scheduling
- Single machine past-sequence-dependent delivery times scheduling with general position-dependent and time-dependent learning effects
- Scheduling problems with position dependent job processing times: computational complexity results
- Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times
- Proportionate flowshops with general position-dependent processing times
- Nested partitions for the large-scale extended job shop scheduling problem
- 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
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Makespan minimization in online scheduling with machine eligibility
This page was built for publication: Research on permutation flow shop scheduling problems with general position-dependent learning effects
