scientific article
From MaRDI portal
Publication:3212909
zbMath0269.90025MaRDI QIDQ3212909
R. Dudek, Milton L. Smith, Shrikant S. Panwalkar
Publication date: 1973
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (39)
Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach ⋮ Scheduling in a sequence dependent setup environment with genetic search ⋮ Flowshop scheduling with dominant machines ⋮ The proportionate two-machine no-wait job shop scheduling problem ⋮ Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness ⋮ Complexity of two dual criteria scheduling problems ⋮ NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness ⋮ A branch and bound algorithm of the single machine schedule with sequence dependent setup times for minimizing total tardiness ⋮ A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness ⋮ Scatter search for minimizing weighted tardiness in a single machine scheduling with setups ⋮ Single-machine scheduling with learning considerations ⋮ An \(O(n^{2})\) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines ⋮ Solving a bicriterion scheduling problem ⋮ A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times ⋮ Grouping products for the optimization of production processes: a case in the steel manufacturing industry ⋮ Assignment of a job load in a distributed system: A multicriteria design method ⋮ Characterizing the set of feasible sequences for n jobs to be carried out on a single machine ⋮ Modeling and Active Learning for Experiments with Quantitative-Sequence Factors ⋮ Proportionate flowshops with general position-dependent processing times ⋮ Algorithms for single machine total tardiness scheduling with sequence dependent setups ⋮ Job oriented production scheduling ⋮ Processing time generation schemes for parallel machine scheduling problems with various correlation structures ⋮ Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming ⋮ The significance of reducing setup times/setup costs ⋮ Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups ⋮ An efficient heuristic approach to the scheduling of jobs in a flowshop ⋮ Online scheduling of ordered flow shops ⋮ A flexible flowshop problem with total flow time minimization ⋮ Theoretical aspects of multicriteria flight gate scheduling: Deterministic and fuzzy models ⋮ Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem ⋮ Minmax scheduling and due-window assignment with position-dependent processing times and job rejection ⋮ Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry ⋮ Four solution techniques for a general one machine scheduling problem. A comparative study ⋮ A bicriteria approach to the two-machine flow shop scheduling problem ⋮ Parallel machine makespan minimization subject to machine availability and total completion time constraints ⋮ Scheduling unit processing time jobs on a single machine with multiple criteria ⋮ Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop ⋮ Two-machine proportionate flowshop scheduling with breakdowns to minimize maximum lateness ⋮ Complexity of single machine, multi-criteria scheduling problems
This page was built for publication:
