scientific article
From MaRDI portal
Publication:3993992
DOI<265::AID-NAV3220390209>3.0.CO;2-L 10.1002/1520-6750(199203)39:2<265::AID-NAV3220390209>3.0.CO;2-LzbMath0762.90035MaRDI QIDQ3993992
Publication date: 13 August 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Branch-and-bound algorithm for total weighted tardiness minimization on parallel machines under release dates assumptions ⋮ A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem ⋮ A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem ⋮ Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications ⋮ A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance ⋮ Dominance-based heuristics for one-machine total cost scheduling problems ⋮ Scheduling on parallel identical machines to minimize total tardiness ⋮ A mixed integer programming approach for the single machine problem with unequal release dates ⋮ A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems ⋮ An investigation on a two-agent single-machine scheduling problem with unequal release dates ⋮ Decomposition of the single machine total tardiness problem ⋮ Mathematical model and algorithm for the reefer mechanic scheduling problem at seaports ⋮ A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates ⋮ An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem ⋮ An \(O( n^2)\) algorithm for scheduling equal-length preemptive jobs on a single machine to minimize total tardiness ⋮ Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function ⋮ Dominance rules for the parallel machine total weighted tardiness scheduling problem with release dates ⋮ Single-machine scheduling with no idle time and release dates to~minimize a regular criterion ⋮ Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. ⋮ A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property ⋮ Minimizing total tardiness on a single machine with unequal release dates ⋮ A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates ⋮ A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects ⋮ Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption ⋮ A scheduling problem to minimize total weighted tardiness in the two-stage assembly flowshop ⋮ Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date ⋮ On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation ⋮ Scheduling a single machine to minimize a regular objective function under setup constraints ⋮ A new dominance rule to minimize total weighted tardiness with unequal release dates. ⋮ Model buidling for air-traffic controllers' workload regulation ⋮ A two-stage assembly-type flowshop scheduling problem for minimizing total tardiness ⋮ Algorithms for minimizing the number of tardy jobs for reducing production cost with uncertain processing times ⋮ Match-up scheduling under a machine breakdown ⋮ The two-machine total completion time flow shop problem ⋮ Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness ⋮ The single-machine total tardiness scheduling problem: review and extensions ⋮ A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems ⋮ A branch-and-bound algorithm for three-machine flowshop scheduling problem to minimize total completion time with separate setup times ⋮ Empirically discovering dominance relations for scheduling problems using an evolutionary algorithm ⋮ Scheduling on parallel machines to minimise maximum lateness for the customer order problem
