A dual algorithm for the one-machine scheduling problem
From MaRDI portal
Publication:4131996
DOI10.1007/BF01580393zbMATH Open0359.90039MaRDI QIDQ4131996FDOQ4131996
Authors: Marshall L. Fisher 
Publication date: 1977
Published in: Mathematical Programming (Search for Journal in Brave)
Cites Work
- A Linear Programming Approach to the Cutting-Stock Problem
- A Dynamic Programming Approach to Sequencing Problems
- The B<scp>oxstep</scp> Method for Large-Scale Optimization
- Title not available (Why is that?)
- Validation of subgradient optimization
- The traveling-salesman problem and minimum spanning trees: Part II
- Optimal Solution of Scheduling Problems Using Lagrange Multipliers: Part I
- One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
- Coordinating Aggregate and Detailed Scheduling Decisions in the One-Machine Job Shop: Part I. Theory
- Minimizing Total Costs in One-Machine Scheduling
- On the N-Job One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution
- Title not available (Why is that?)
- Branch-and-Bound Strategies for Dynamic Programming
- Scheduling to Minimize Interaction Cost
- A hybrid algorithm for the one machine sequencing problem to minimize total tardiness
- Constructive Duality in Integer Programming
- Relaxation Methods for Pure and Mixed Integer Programming Problems
- Title not available (Why is that?)
- An experimental comparison of solution algorithms for the single-machine tardiness problem
- The sequencing of “related” jobs
Cited In (66)
- A Branch-and-Bound approach to solve a Bicriterion Scheduling Problem involving Squared Flowtime and Maximum Tardiness
- Minimizing total flowtime and maximum job lateness in the twomachine flowshop system: a computerized algorithm
- Matheuristics: survey and synthesis
- Integration of finished goods batch delivery into production scheduling via total tardiness minimization
- Metaheuristic-based Lagrangian relaxation for total weighted tardiness minimization
- Bicriteria scheduling with vacations on a single machine
- Minimisation of total tardiness for identical parallel machine scheduling using genetic algorithm
- A heuristic approach for single-machine scheduling with due dates and class setups.
- Real-world extensions to scheduling algorithms based on Lagrangian relaxation
- A hybrid approach to discrete mathematical programming
- Chance-constrained model for uncertain job shop scheduling problem
- A new branch and bound algorithm for minimizing the weighted number of tardy jobs
- Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem
- A Single Machine Bicriterion Scheduling Problem and an Optimizing Branch-and-Bound Procedure
- Scheduling preemptive open shops to minimize total tardiness
- A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times
- An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments
- Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs
- Minimizing total tardiness in a scheduling problem with a learning effect
- A controlled search simulated annealing method for the single machine weighted tardiness problem
- Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness
- An efficient tabu search approach for the two-machine preemptive open shop scheduling problem.
- A two-machine flowshop scheduling problem with precedence constraint on two jobs
- Improving the performance of enumerative search methods. I: Exploiting structure and intelligence
- Mathematical programming formulations for machine scheduling: A survey
- A simulated annealing approach for the one-machine mean tardiness scheduling problem
- Job lateness in a two-machine flowshop with setup times separated
- Two-machine flowshop scheduling to minimize total tardiness
- Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times
- A neural network model for scheduling problems
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
- Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times
- Decomposition of the single machine total tardiness problem
- Single machine scheduling with nonlinear cost functions
- Minimizing the weighted number of tardy jobs on a single machine with release dates
- A heuristic approach to bicriteria scheduling
- A tabu method for a two-agent single-machine scheduling with deterioration jobs
- An investigation on a two-agent single-machine scheduling problem with unequal release dates
- The single-machine total tardiness problem with unequal release times and a linear deterioration
- A two-machine flowshop problem with two agents
- A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem
- Surrogate duality relaxation for job shop scheduling
- Analysis of a linearization heuristic for single-machine scheduling to maximize profit
- A survey of algorithms for the single machine total weighted tardiness scheduling problem
- Scheduling identical parallel machines to minimize total weighted completion time
- Minimizing tardiness in a two-machine flow-shop
- Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming
- A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems
- A heuristic for the single machine tardiness problem
- Dynamic programming and decomposition approaches for the single machine total tardiness problem
- The two-machine flowshop scheduling problem with total tardiness
- An empirical study of policies to integrate reactive scheduling and control in just-in-time job shop environments
- Deterministic job-shop scheduling: Past, present and future
- Single machine earliness and tardiness scheduling
- A greedy heuristic for the mean tardiness sequencing problem
- Using short-term memory to minimize the weighted number of late jobs on a single machine.
- A General Framework for Stochastic One-machine Scheduling Problems with Zero Release Times and No Partial Ordering
- Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
- A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents
- A decomposition algorithm for the single machine total tardiness problem
- Minimizing the sum of squares lateness on a single machine
- A new lower bounding scheme for the total weighted tardiness problem.
- An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop
- Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems
- Rescheduling problems with allowing for the unexpected new jobs arrival
- A bicriterion scheduling problem involving total flowtime and total tardiness
This page was built for publication: A dual algorithm for the one-machine scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4131996)
