Scheduling with time-dependent discrepancy times

DOI10.1007/s10951-016-0472-2zbMath1386.90057OpenAlexW2340320076MaRDI QIDQ1702735

Helmut A. Sedding, Florian Jaehn

Publication date: 28 February 2018

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-016-0472-2

zbMATH Keywords

single-machine schedulingtime-dependent schedulingassembly-line worker path minimizationconvex processing timenonmonotonic piecewise-linear processing time

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (3)

Scheduling jobs with a V-shaped time-dependent processing time ⋮ A comparison of algorithms for finding an efficient theme park tour ⋮ A review of four decades of time-dependent scheduling: main results, new topics, and open problems

Cites Work

• Unnamed Item
• Unnamed Item
• Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
• Part logistics in the automotive industry: decision problems, literature review and research agenda
• Preemption in single machine earliness/tardiness scheduling
• A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
• An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan
• Optimization of workcell layouts in a mixed-model assembly line environment
• Ant algorithms for a time and space constrained assembly line balancing problem
• A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
• Time-dependent scheduling
• On a scheduling problem of time deteriorating jobs
• A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs
• A concise survey of scheduling with time-dependent processing times
• The assembly line balancing and scheduling problem with sequence-dependent setup times: problem extension, model formulation and efficient heuristics
• An exact algorithm for single-machine scheduling without machine idle time
• A classification of assembly line balancing problems
• Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard
• Balancing and scheduling tasks in assembly lines with sequence-dependent setup times
• A state-of-the-art review on scheduling with learning effects
• Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem
• New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling
• Scheduling Problems with Learning and Ageing Effects: A Survey
• Scheduling with time dependent processing times: Review and extensions
• Minimizing Total Tardiness on One Machine is NP-Hard
• A Dynamic Programming Approach to Sequencing Problems
• Minimizing the average deviation of job completion times about a common due date
• Scheduling Deteriorating Jobs on a Single Processor
• One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties
• Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date
• Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• Scheduling deteriorating jobs to minimize makespan
• Scheduling jobs with piecewise linear decreasing processing times
• A Functional Equation and its Application to Resource Allocation and Sequencing Problems

This page was built for publication: Scheduling with time-dependent discrepancy times