Single machine scheduling with controllable release and processing parameters

DOI10.1016/j.dam.2005.04.014zbMath1111.90045OpenAlexW2149456682MaRDI QIDQ2433805

Vitaly A. Strusevich, Natalia V. Shakhlevich

Publication date: 30 October 2006

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2005.04.014

zbMATH Keywords

single machine schedulingcontrollable processing timescontrollable release datescontrollable processing speedscontrollable release speeds

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Production models (90B30)

Related Items

Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications, A survey of scheduling with controllable processing times, Scheduling with compressible and stochastic release dates, Inverse interval scheduling via reduction on a single machine, Scheduling problems with rejection to minimize the \(k\)-th power of the makespan plus the total rejection cost, Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times, The symmetric quadratic knapsack problem: approximation and scheduling applications, Single machine scheduling with rejection to minimize the \(k\)-th power of the makespan, Scheduling a batching machine with convex resource consumption functions, Scheduling with controllable release dates and processing times: Makespan minimization, Scheduling with controllable release dates and processing times: total completion time minimization, A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates, Scheduling with due date assignment under special conditions on job processing, Bicriteria robotic cell scheduling with controllable processing times, A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine, Just-in-time scheduling with controllable processing times on parallel machines, A unified approach for scheduling with convex resource consumption functions using positional penalties, Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling, Optimal due date assignment and resource allocation in a group technology scheduling environment, FPTAS for half-products minimization with scheduling applications, Power-aware scheduling for makespan and flow, Fast approximation schemes for Boolean programming and scheduling problems related to positive convex half-product

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of results for sequencing problems with controllable processing times
• A bicriterion approach to time/cost trade-offs in sequencing
• Single machine scheduling problem with a common deadline and resource dependent release dates
• An approximation algorithm for a single-machine scheduling problem with release times, delivery times and controllable processing times
• A survey of the state-of-the-art of common due date assignment and scheduling research
• Positive half-products and scheduling with controllable processing times
• Two machine flow shop scheduling problem with no wait in process: Controllable machine speeds
• Two machine mixed shop scheduling problem with controllable machine speeds
• Scheduling with controllable release dates and processing times: Makespan minimization
• Supply chain scheduling: sequence coordination
• Minimization of Half-Products
• Minimizing Total Tardiness on One Machine is NP-Hard
• Supply Chain Scheduling: Batching and Delivery
• TWO MACHINE OPEN SHOP SCHEDULING PROBLEM WITH CONTROLLABLE MACHINE SPEEDS
• Combinatorial Optimization with Rational Objective Functions
• Scheduling with resource-dependent release dates—a comparison of two different resource consumption functions
• An O(n log n) Algorithm for the Two-Machine Flow Shop Problem with Controllable Machine Speeds