Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect

DOI10.1080/0305215X.2018.1521397OpenAlexW2898403761WikidataQ129050063 ScholiaQ129050063MaRDI QIDQ5059196

Ji-Bo Wang, Danyu Bai, Xin-Na Geng

Publication date: 23 December 2022

Published in: Engineering Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0305215x.2018.1521397

zbMATH Keywords

schedulingresource allocationflowshoplearning effect\textsf{no-wait}

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (19)

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 ⋮ 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 ⋮ Resource allocation flowshop scheduling with learning effect and slack due window assignment ⋮ 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 ⋮ Heuristic and exact algorithms for single-machine scheduling problems with general truncated learning effects ⋮ 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 ⋮ Optimization for due-window assignment scheduling with position-dependent weights ⋮ Resource dependent scheduling with truncated learning effects ⋮ Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection ⋮ Flow Shop Resource Allocation Scheduling with Due Date Assignment, Learning Effect and Position-Dependent Weights ⋮ 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 ⋮ Study on Resource-Dependent No-Wait Flow Shop Scheduling with Different Due-Window Assignment and Learning Effects

Cites Work

• Unnamed Item
• No-wait flowshops with bicriteria of makespan and maximum lateness.
• A survey of scheduling with controllable processing times
• Optimal due-date assignment problem with learning effect and resource-dependent processing times
• A state-of-the-art review on scheduling with learning effects
• Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• No-wait flowshops with bicriteria of makespan and total completion time
• Bi-objective scheduling on uniform parallel machines considering electricity cost
• Outsourcing and scheduling for a two-machine flow shop with release times
• Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop
• A note on resource allocation scheduling with position-dependent workloads

This page was built for publication: Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect