scientific article; zbMATH DE number 3550186

zbMATH Open0353.68071MaRDI QIDQ4124332FDOQ4124332

Authors: Eugene L. Lawler 

Publication date: 1977

Title of this publication is not available (Why is that?)

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Cited In (only showing first 100 items - show all)

• Approximation algorithms for scheduling problems with a modified total weighted tardiness objective
• Single machine total tardiness maximization problems: complexity and algorithms
• Minimizing total tardiness on parallel machines with preemptions
• Single machine scheduling problems with financial resource constraints: some complexity results and properties
• Scheduling with variable time slot costs
• Minimizing total tardiness on a single machine with unequal release dates
• A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
• Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem
• Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
• General stochastic single-machine scheduling with regular cost functions
• Single-machine scheduling under the job rejection constraint
• An Exact Algorithm for the Single-Machine Earliness–Tardiness Scheduling Problem
• Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times
• Mathematical programming formulations for machine scheduling: A survey
• The coordination of scheduling and batch deliveries
• Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
• Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
• Non-approximability of just-in-time scheduling
• Exact algorithms for single-machine scheduling with time windows and precedence constraints
• Scheduling two job families on a single machine with two competitive agents
• A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times
• Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling
• Iterated local search for single-machine scheduling with sequence-dependent setup times to minimize total weighted tardiness
• Neighborhood search procedures for single machine tardiness scheduling with sequence-dependent setups
• Inverse Booking Problem: Inverse Chromatic Number Problem in Interval Graphs
• Genetic algorithm-based subproblem solution procedures for a modified shifting bottleneck heuristic for complex job shops
• A survey of scheduling with controllable processing times
• Minimising total tardiness for a single machine scheduling problem with family setups and resource constraints
• Optimal restricted due date assignment in scheduling
• On the complexity of generalized due date scheduling problems
• Single machine scheduling with controllable release and processing parameters
• Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
• A new dominance rule to minimize total weighted tardiness with unequal release dates.
• An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
• A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
• Algorithms for some maximization scheduling problems on a single machine
• Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties
• A theoretical development for the total tardiness problem and its application in branch and bound algorithms
• Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity
• An investigation on a two-agent single-machine scheduling problem with unequal release dates
• Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
• Scheduling jobs on parallel machines with sequence-dependent setup times
• A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence dependent setup times
• A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
• A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects
• Complexity results for scheduling chains on a single machine
• On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
• A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
• Two due date assignment problems in scheduling a single machine
• Multi-agent scheduling on a single machine with max-form criteria
• Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness
• Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom
• The single-machine total tardiness scheduling problem: review and extensions
• Scheduling parallel machines to minimize total weighted and unweighted tardiness
• Truck scheduling in cross-docking terminals with fixed outbound departures
• Single machine scheduling with release times, deadlines and tardiness objectives
• Minimizing tardiness in a two-machine flow-shop
• A tabu search algorithm for the single machine total weighted tardiness problem
• A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems
• Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach
• Parallel machine scheduling with a common server
• A hybrid algorithm for the single-machine total tardiness problem
• A population-based variable neighborhood search for the single machine total weighted tardiness problem
• A heuristic for the single machine tardiness problem
• Fast neighborhood search for the single machine total weighted tardiness problem
• A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem
• Dynamic programming and decomposition approaches for the single machine total tardiness problem
• A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine
• A tabu search algorithm for parallel machine total tardiness problem
• Single machine earliness and tardiness scheduling
• A greedy heuristic for the mean tardiness sequencing problem
• Dispatching heuristics for the single machine weighted quadratic tardiness scheduling problem
• An exact approach for scheduling jobs with regular step cost functions on a single machine
• An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem
• Single machine scheduling to minimize total weighted tardiness
• Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
• Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem
• The single-machine total weighted tardiness scheduling problem with position-based learning effects
• \(\text{MA}\mid\text{PM}\): memetic algorithms with population management
• A decomposition algorithm for the single machine total tardiness problem
• A fully polynomial approximation scheme for the total tardiness problem
• An exact algorithm for the precedence-constrained single-machine scheduling problem
• Improving the complexities of approximation algorithms for optimization problems
• A note on the complexity of the problem of two-agent scheduling on a single machine
• On decomposition of the total tardiness problem
• A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times
• Rescheduling problems with allowing for the unexpected new jobs arrival
• Approximation algorithms for minimizing the total weighted tardiness on a single machine
• Scheduling with monotonous earliness and tardiness penalties
• New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives
• Minimizing total weighted tardiness on a single batch process machine with incompatible job families
• A note on reverse scheduling with maximum lateness objective
• A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
• Modeling and solving the waste valorization production and distribution scheduling problem
• Complexities of some problems on multi-agent scheduling on a single machine
• Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines
• Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work
• Scheduling with time-dependent discrepancy times
• On the complexity of scheduling problems with a fixed number of parallel identical machines
• A note on competing-agent Pareto-scheduling

This page was built for publication:

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