Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect
From MaRDI portal
(Redirected from Publication:5059196)
Recommendations
- Research on common due window assignment flowshop scheduling with learning effect and resource allocation
- Study on resource-dependent no-wait flow shop scheduling with different due-window assignment and learning effects
- Flow shop resource allocation scheduling with due date assignment, learning effect and position-dependent weights
- Due date assignment scheduling problems with resource constraints
- Resource allocation flowshop scheduling with learning effect and slack due window assignment
Cites work
- A note on resource allocation scheduling with position-dependent workloads
- A state-of-the-art review on scheduling with learning effects
- A survey of scheduling with controllable processing times
- Bi-objective scheduling on uniform parallel machines considering electricity cost
- Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- No-wait flowshops with bicriteria of makespan and maximum lateness.
- No-wait flowshops with bicriteria of makespan and total completion time
- Optimal due-date assignment problem with learning effect and resource-dependent processing times
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Outsourcing and scheduling for a two-machine flow shop with release times
- Single-machine due-window assignment and scheduling with learning effect and resource-dependent processing times
Cited in
(30)- Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights
- Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads
- Optimization for due-window assignment scheduling with position-dependent weights
- 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
- Resource dependent scheduling with truncated learning effects
- Study on resource-dependent no-wait flow shop scheduling with different due-window assignment and learning effects
- Research on common due window assignment flowshop scheduling with learning effect and resource allocation
- A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration
- Solution algorithms for single-machine resource allocation scheduling with deteriorating jobs and group technology
- Scheduling with a position-weighted learning effect and job release dates
- Minimax scheduling problem with common due-date and controlled processing times and resource restriction
- Flow shop resource allocation scheduling with due date assignment, learning effect and position-dependent weights
- A Bicriterion Approach to Due Date Assignment Scheduling in Single-Machine with Position-Dependent Weights
- Bicriterion scheduling with truncated learning effects and convex controllable processing times
- A note on due-date assignment scheduling with job-dependent learning effects and convex resource allocation
- Solution algorithms for single-machine scheduling with learning effects and exponential past-sequence-dependent delivery times
- Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection
- INEH-VNS algorithm solved automatic production system scheduling problem under just-in-time environment
- A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing
- Single machine scheduling with step-learning
- Single-machine common due-window assignment and scheduling with position-dependent weights, delivery time, learning effect and resource allocations
- Permutation flow shop scheduling with makespan objective and truncated learning effects
- No-idle flow shop scheduling with deteriorating jobs and common due date under dominating machines
- Common due window assignment and single machine scheduling with delivery time, resource allocation, and job-dependent learning effect
- Scheduling problems on parallel dedicated machines with non-renewable resource
- Single machine minsum and minmax common due date assignment and scheduling problems involving general position-dependent workloads
- Scheduling with due date assignment and placement uncertainty subject to no tardy orders
- Due-window assignment scheduling in the proportionate flow shop setting
- Note on the time complexity of resource constrained scheduling with general truncated job-dependent learning effect
This page was built for publication: Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5059196)
