Scheduling problems with position dependent job processing times: computational complexity results

DOI10.1007/S10479-012-1098-1zbMATH Open1251.90181OpenAlexW2029348542MaRDI QIDQ1761835FDOQ1761835

Radosław Rudek

Publication date: 15 November 2012

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-012-1098-1

zbMATH Keywords

computational complexityschedulinglearning effectaging effect

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

• Title not available (Why is that?)
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Time-dependent scheduling
• A state-of-the-art review on scheduling with learning effects
• Single-machine scheduling with learning considerations
• A note on scheduling on a single processor with speed dependent on a number of executed jobs
• A concise survey of scheduling with time-dependent processing times
• Parallel machine scheduling with a learning effect
• Scheduling jobs with position-dependent processing times
• Single machine scheduling with learning effect considerations
• Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance
• Minimizing the makespan in a single-machine scheduling problem with the cyclic process of an aging effect
• Scheduling problems with general effects of deterioration and learning
• A note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models
• Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects
• Scheduling orders on either dedicated or flexible machines in parallel to minimize total weighted completion time
• Single-machine scheduling with both deterioration and learning effects
• Single-machine scheduling problems with time and position dependent processing times
• A Simple Optimality Proof of Moore's Sequencing Algorithm
• Scheduling jobs under an aging effect
• Single-machine scheduling with deteriorating functions for job processing times
• A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates
• Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
• The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times
• A Theory of the Learning Process

Cited In (27)

• Research on permutation flow shop scheduling problems with general position-dependent learning effects
• Multitasking scheduling problems with deterioration effect
• Single-machine scheduling with learning effects and maintenance: a methodological note on some polynomial-time solvable cases
• A scheduling problem with job values given as a power function of their completion times
• A cloud based job sequencing with sequence-dependent setup for sheet metal manufacturing
• A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection
• Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation
• A note on single-machine scheduling with sum-of-processing-time-based learning and forgetting effects
• Hybrid optimization methods for time-dependent sequencing problems
• Unrelated parallel-machine scheduling with deterioration effects and deteriorating multi-maintenance activities for minimizing the total completion time
• Approximation algorithms for some position-dependent scheduling problems
• Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection
• Two-agent scheduling problems with the general position-dependent processing time
• Parallel-machine scheduling with maintenance: praising the assignment problem
• Maximum lateness scheduling on two-person cooperative games with variable processing times and common due date
• A Note on Scheduling Jobs with Extended Sum-of-Processing-Times-Based and Position-Based Learning Effect
• The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times
• Scheduling with a position-weighted learning effect and job release dates
• Polyhedral results for position-based scheduling of chains on a single machine
• Strong NP-hardness of scheduling problems with learning or aging effect
• SCHEDULING JOBS WITH PROCESSING TIMES DEPENDENT ON POSITION, STARTING TIME, AND ALLOTTED RESOURCE
• Job release scheduling problem: complexity and an approximation algorithm
• Formulating a scheduling problem with almost identical jobs by using positional completion times
• Title not available (Why is that?)
• Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads
• Machine scheduling problems with a position-dependent deterioration
• Title not available (Why is that?)

This page was built for publication: Scheduling problems with position dependent job processing times: computational complexity results

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