scientific article

Publication date: 5 March 2007

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Dynamic programming (90C39) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (only showing first 100 items - show all)

Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times ⋮ Online Optimization of Busy Time on Parallel Machines ⋮ Permutation flowshop scheduling with simple linear deterioration ⋮ Multitasking scheduling problems with two competitive agents ⋮ Parallel batch scheduling with nested processing set restrictions ⋮ Robust single machine makespan scheduling with release date uncertainty ⋮ Optimal Allocation for Chunked-Reward Advertising ⋮ No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines ⋮ An exact framework for the discrete parallel machine scheduling location problem ⋮ The pairwise flowtime network construction problem ⋮ Robust scheduling with budgeted uncertainty ⋮ Schedules with a single preemption on uniform parallel machines ⋮ Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations ⋮ On some lower bounds for the permutation flowshop problem ⋮ Scheduling equal-length jobs with arbitrary sizes on uniform parallel batch machines ⋮ Parallel Machines Scheduling with Deteriorating Maintenance Activities and Job Rejection ⋮ Shop scheduling in manufacturing environments: a review ⋮ Multitasking scheduling with multiple rate‐modifying activities ⋮ Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs ⋮ Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost ⋮ Rescheduling to Minimize the Maximum Lateness Under the Sequence Disruptions of Original Jobs ⋮ Power of Preemption for Minimizing Total Completion Time on Uniform Parallel Machines ⋮ Competitive two-agent scheduling with release dates and preemption on a single machine ⋮ Towards a Robust Scheduling on Unrelated Parallel Machines: A Scenarios Based Approach ⋮ Minimizing the total weighted duration of courses in a single machine problem with precedence constraints ⋮ Fairer comparisons for travelling salesman problem solutions using hash functions ⋮ Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine ⋮ SPT optimality (mostly) via linear programming ⋮ Scheduling uniform machines with restricted assignment ⋮ Organization of the control subsystem in real-time computing systems ⋮ Just‐in‐time scheduling problem with due windows and release dates for precast bridge girders ⋮ Faster algorithms for bicriteria scheduling of identical jobs on uniform machines ⋮ Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines ⋮ Scheduling jobs on parallel machines to minimize a regular step total cost function ⋮ Unbounded parallel-batching scheduling with two competitive agents ⋮ Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption ⋮ Bounded parallel-batching scheduling with two competing agents ⋮ Single machine scheduling with delivery dates and cumulative payoffs ⋮ Unrelated parallel-machine scheduling with deteriorating maintenance activities to minimize the total completion time ⋮ Construction of cyclic schedules in presence of parallel machines ⋮ Scheduling Fully Parallel Jobs with Integer Parallel Units ⋮ Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem ⋮ OPTIMAL SEMI-ONLINE ALGORITHMS FOR m-BATCH-MACHINE FLOW SHOP SCHEDULING ⋮ A solution approach to find the critical path in a time-constrained activity network ⋮ Flow shop scheduling problem with position-dependent processing times ⋮ A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints ⋮ Risk Averse Scheduling with Scenarios ⋮ Approximation algorithms for the three-machine proportionate mixed shop scheduling ⋮ Multistage interval scheduling games ⋮ Risk-averse single machine scheduling: complexity and approximation ⋮ Unrelated Parallel-Machine Scheduling with Controllable Processing Times and Impact of Deteriorating Maintenance Activities under Consideration ⋮ Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness ⋮ Improved algorithms for single-machine common due window assignment and scheduling with batch deliveries ⋮ Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times ⋮ Synthesizing a multiprocessor system for scheduling with interruptions and execution intervals ⋮ Similarities between meta-heuristics algorithms and the science of life ⋮ Scheduling a proportionate flow shop of batching machines ⋮ Shop scheduling problems with pliable jobs ⋮ Open-shop scheduling for unit jobs under precedence constraints ⋮ Flow Shop for Dual CPUs in Dynamic Voltage Scaling ⋮ A Local Search Algorithm for the Single Machine Scheduling Problem with Setups and a Storage ⋮ Parallel execution of schedules with random dependency graph ⋮ Unnamed Item ⋮ Single parameter analysis of power of preemption on two and three uniform machines ⋮ Single-machine batch scheduling with job processing time compatibility ⋮ A survey on how the structure of precedence constraints may change the complexity class of scheduling problems ⋮ Single machine scheduling problems with uncertain parameters and the OWA criterion ⋮ Parametric analysis of the quality of single preemption schedules on three uniform parallel machines ⋮ Distribution of a heterogeneous set of resources in multiprocessor scheduling ⋮ Using solvable real time classes for jitter-minimized planning ⋮ Optimally competitive list batching ⋮ Biogeography-based optimization for optimal job scheduling in cloud computing ⋮ Scheduling with few changes ⋮ Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times ⋮ A single machine scheduling problem with two-dimensional vector packing constraints ⋮ Network construction problems with due dates ⋮ Book review of: A. Agnetis et al., Multiagent scheduling. Models and algorithms ⋮ A survey on single crane scheduling in automated storage/retrieval systems ⋮ Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms ⋮ Variability of completion time differences in permutation flow shop scheduling ⋮ An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization ⋮ Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach ⋮ Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty ⋮ Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies ⋮ Adaptive online scheduling of tasks with anytime property on heterogeneous resources ⋮ Parallel batch scheduling of equal-length jobs with release and due dates ⋮ Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost ⋮ Simple matching vs linear assignment in scheduling models with positional effects: a critical review ⋮ Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines ⋮ On an extension of the Sort \& Search method with application to scheduling theory ⋮ A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective ⋮ Single-machine batch scheduling minimizing weighted flow times and delivery costs ⋮ An application of dynamic programming to assign pressing tanks at wineries ⋮ Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities ⋮ A batch-oblivious approach for complex job-shop scheduling problems ⋮ Preemptive scheduling of equal-length jobs in polynomial time ⋮ On bilevel machine scheduling problems ⋮ Berth allocation with time-dependent physical limitations on vessels ⋮ An ant colony optimization approach to a permutational flowshop scheduling problem with outsourcing allowed ⋮ New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem

This page was built for publication: