Single machine scheduling with step-learning

DOI10.1007/S10951-022-00763-5zbMATH Open1543.90083MaRDI QIDQ6577339

Baruch Mor, Gur Mosheiov, Matan Atsmony

Publication date: 23 July 2024

Published in: (Search for Journal in Brave)

zbMATH Keywords

schedulingdynamic programmingsingle-machinejob-dependent learning-datesstep-learning

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Scheduling with time-changing effects and rate-modifying activities
• Models and algorithms of time-dependent scheduling
• Time-dependent scheduling
• Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration
• Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities
• Flowshop scheduling with learning effect and job rejection
• Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects
• New results for an open time-dependent scheduling problem
• A review of four decades of time-dependent scheduling: main results, new topics, and open problems
• Single-machine bi-criterion scheduling with release times and exponentially time-dependent learning effects
• Scheduling with step-deteriorating jobs to minimize the makespan
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect
• Research on m‐machine flow shop scheduling with truncated learning effects
• Metaheuristics for two-stage flow-shop assembly problem with a truncation learning function

This page was built for publication: Single machine scheduling with step-learning

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