zbMath0798.90028MaRDI QIDQ3995531
No author found.
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A newsvendor inventory model with an emergency order to supply a non-increasing fraction of shortage,
Sensitivity analysis of list scheduling heuristics,
Single machine scheduling with release and due date assignment to minimize the weighted number of late jobs,
A facility location model for logistics systems including reverse flows: the case of remanufacturing activities,
Performance evaluation of a multi-echelon production, transportation and distribution system: a matrix analytical approach,
Computing redundant resources for the resource constrained project scheduling problem,
Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems,
Solving general multi-class closed queuing networks using parametric decomposition,
Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches,
An integrated production and inventory model to dampen upstream demand variability in the supply chain,
A mixed integer programming approach for the single machine problem with unequal release dates,
A Bayesian analysis of a queueing system with unlimited service,
Stability of a schedule minimizing mean flow time,
Impact of product mix flexibility and allocation policies on technology,
An efficiency measurement framework for multi-stage production systems,
An open shop scheduling problem with a non-bottleneck machine,
Two-stage no-wait scheduling models with setup and removal times separated,
On the existence of schedules that are near-optimal for both makespan and total weighted completion time,
An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem,
Heuristic stability: a permutation disarray measure,
A reactive GRASP and path relinking for a combined production-distribution problem,
Processing networks with planned inventories: Tandem queues with feedback,
Optimization of order-up-to-S policies for two-level inventory systems with compound Poisson demand,
Some thoughts on combinatorial optimisation,
Generalized pairwise interchanges and machine scheduling,
Decomposition and iterative aggregation in hierarchical and decentralised planning structures,
Is a unit-job shop not easier than identical parallel machines?,
Partial solutions and multifit algorithm for multiprocessor scheduling,
The lazy bureaucrat scheduling problem,
Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity,
An alternative framework to Lagrangian relaxation approach for job shop scheduling.,
Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead,
Properties of optimal schedules in preemptive shop scheduling,
Routing open shop and flow shop scheduling problems,
The incremental bullwhip effect of operational deviations in an arborescent supply chain with requirements planning,
An improved on-line algorithm for single parallel-batch machine scheduling with delivery times,
On the approximability of average completion time scheduling under precedence constraints.,
Real-time scheduling to minimize machine busy times,
A concise survey of scheduling with time-dependent processing times,
Single machine scheduling to minimize the number of late jobs under uncertainty.,
Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem.,
Optimal algorithms for online single machine scheduling with deteriorating jobs,
Scheduling problems for parallel dedicated machines under multiple resource constraints.,
Customer lead time management when both demand and price are lead time sensitive.,
Crowdsourcing new product design on the web: an analysis of online designer platform service,
Scheduling multimodal transportation systems.,
Flexible supply contracts under price uncertainty,
Optimizing busy time on parallel machines,
Online over time scheduling on parallel-batch machines: a survey,
A note: Common due date assignment for a single machine scheduling with the rate-modifying activity,
Approximation results for flow shop scheduling problems with machine availability constraints,
High-multiplicity cyclic job shop scheduling,
Online scheduling on unbounded parallel-batch machines with incompatible job families,
Scheduling and constraint propagation,
Fuzzy hierarchical production planning (with a case study),
A two-stage hybrid flowshop with uniform machines and setup times,
Inapproximability results for no-wait job shop scheduling.,
Minimizing makespan for a bipartite graph on a single processor with an integer precedence delay.,
The integrality of the lot size in the basic EOQ and EPQ models: applications to other production-inventory models,
Batching decisions for assembly production systems,
Linear programming models with planned lead times for supply chain operations planning,
A model for analyzing multi-channel distribution systems,
Minimizing total busy time in parallel scheduling with application to optical networks,
A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints,
Online scheduling on unbounded parallel-batch machines to minimize the makespan,
Heuristics for capacity planning problems with congestion,
Minimizing makespan in two-stage hybrid cross docking scheduling problem,
Preemptive scheduling and antichain polyhedra,
Optimal policy for an inventory system with backlogging and all-units discounts: Application to the composite lot size model,
Production strategies for a stochastic lot-sizing problem with constant capacity,
On-line scheduling with delivery time on a single batch machine,
Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps,
A fast bipartite network flow algorithm for selective assembly,
The flow shop problem with no-idle constraints: a review and approximation,
Coordinated supply chain management,
Multi-echelon systems: A service measure perspective,
Exact evaluation of \((R,Q)\)-policies for two-level inventory systems with Poisson demand,
A two-echelon allocation model and the value of information under correlated forecasts and demands,
Evaluation of \((R,Q)\)-policies for two-level inventory systems with generally distributed customer inter-arrival times,
Heuristics for the two-stage job shop scheduling problem with a bottleneck machine,
Incentive and production decisions for remanufacturing operations,
An optimal online algorithm for single machine scheduling with bounded delivery times,
A stochastic dynamic traveling salesman problem with hard time windows,
Goodwill, inventory penalty, and adaptive supply chain management,
Calculating safety stocks for assembly systems with random component procurement lead times: a branch and bound algorithm,
A 1. 47-approximation for a preemptive single-machine scheduling problem,
Scheduling on uniform parallel machines to minimize maximum lateness,
Group technology approach to the open shop scheduling problem with batch setup times,
Scheduling installations in the telecommunications industry,
A hybrid two-stage flowshop with part family, batch production, major and minor set-ups,
Aggregate scheduling and network solving of multi-stage and multi-item manufacturing systems,
Scheduling parallel machines with inclusive processing set restrictions and job release times,
Models for robust tactical planning in multi-stage production systems with uncertain demands,
Scheduling one batch processor subject to job release dates,
Heuristics for the flow line problem with setup costs,
Price, delivery time guarantees and capacity selection,
Optimal control of a divergent multi-echelon inventory system,
Cellular control of manufacturing systems,
Worst-case analysis of heuristics for open shops with parallel machines,
A cyclic versus flexible approach to materials ordering in make-to-order assembly,
Task scheduling in networks,
An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times,
Scheduling jobs that arrive over time,
A preliminary study on modeling stability of planning inventory and incentive effects,
Echelon-stock \((R,nT)\) control in two-stage serial stochastic inventory systems,
Robust single machine makespan scheduling with release date uncertainty,
Unnamed Item,
An approximation algorithm for stacking up bins from a conveyer onto pallets,
Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds,
Online Batch Scheduling of Incompatible Job Families with Variable Lookahead Interval,
The role of put option contracts in supply chain management under inflation,
Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests,
Min Sum Edge Coloring in Multigraphs Via Configuration LP,
Inventory control with modulated demand and a partially observed modulation process,
Approximation algorithms for batch scheduling with processing set restrictions,
Approximation algorithms for two-machine proportionate routing open shop on a tree,
Analysis of second order properties of production-inventory systems with lost sales,
SPT optimality (mostly) via linear programming,
A Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p Norm,
Can accessing much data reshape the theory? Inventory theory under the challenge of data-driven systems,
On the complexity of scheduling problems with a fixed number of parallel identical machines,
On Integral Policies in Deterministic and Stochastic Distribution Systems,
Axiomatic rationality and ecological rationality,
Modeling industrial lot sizing problems: a review,
Combinação de abordagens GLSP e ATSP para o problema de dimensionamento e sequenciamento de lotes de produção de suplementos para nutrição animal,
Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds,
Optimal on-line algorithms for single-machine scheduling,
Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines,
A note on scheduling flowshops with flexible stage ordering,
Minimizing maximum earliness on parallel identical machines,
How good is a dense shop schedule?,
A two-echelon inventory system with transportation capacity constraint,
Queueing systems with leadtime constraints: a fluid-model approach for admission and sequencing control,
Aggregate production planning for a continuous reconfigurable manufacturing process,
Optimal preemptive scheduling on a fixed number of identical parallel machines,
Minmax earliness-tardiness costs with unit processing time jobs,
Scheduling advertisements on a web page to maximize revenue,
A \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing times,
Two-machine open shop scheduling with an availability constraint,
Sensitivity analysis of scheduling algorithms,
A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates.,
Linear time approximation scheme for the multiprocessor open shop problem,
Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry,
The impact of product substitution on retail merchandising,
An optimal online algorithm for scheduling two machines with release times,
A scenario-based stochastic programming approach for technology and capacity planning,
b9000A 1/4 approximate algorithm for P2/tree/Cmax,
SUPPLY CHAIN MODELED AS A METABOLIC PATHWAY,
A new integer programming formulation of the graphical traveling salesman problem,
The Periodic Joint Replenishment Problem Is Strongly 𝒩𝒫-Hard,
PRODUCTIVITY OR UNEXPECTED DEMAND SHOCKS: WHAT DETERMINES FIRMS' INVESTMENT AND EXIT DECISIONS?,
Event-Time Models for Supply Chain Scheduling,
Exact and approximate algorithms for the multi-period procurement problem where dedicated supplier capacity can be reserved,
Single item lot sizing problems,
Performance guarantees for flowshop heuristics to minimize makespan,
Permutation flowshop scheduling problems with maximal and minimal time lags,
Multicriteria modeling and tradeoff analysis for oil load dispatch and hauling operations at Noble energy,
Lower bounds for on-line single-machine scheduling.,
A survey on how the structure of precedence constraints may change the complexity class of scheduling problems,
Makespan minimization on uniform parallel machines with release times,
A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling,
Machine scheduling with earliness, tardiness and non-execution penalties,
Mean flow time minimization with given bounds of processing times,
A parallel machine schedule updating game with compensations and clients averse to uncertain loss,
Optimal inventory management using retail prepacks,
Scheduling shops to minimize the weighted number of late jobs,
A heuristic for parallel machine scheduling with agreeable due dates to minimize the number of late jobs,
A memetic algorithm with dynamic population management for an integrated production-distribution problem,
Exponential tightness for integral-type functionals of centered independent differently distributed random variables,
Approximation schemes for a class of subset selection problems,
Open shop, satellite communication and a theorem by Egerváry (1931),
An iterative heuristic for the single machine dynamic total completion time scheduling problem,
On the relationship of capacitated production/inventory models to manufacturing flow control models,
Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time,
An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times,
Close integration of pricing and supply chain decisions has strategic as well as operations level benefits,
Supply chain scheduling: sequence coordination,
Single machine scheduling with controllable release and processing parameters,
Analysis of multi-stage open shop processing systems,
Minimizing the number of late jobs for the two-machine unit-time job-shop scheduling problem,
Incorporation of inefficiency associated with link flows in efficiency measurement in network DEA,
Facets for single module and multi-module capacitated lot-sizing problems without backlogging,
Complexity of mixed shop scheduling problems: A survey,
Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes,
Linear programming system identification: the general nonnegative parameters case,
On the performance of binomial and beta-binomial models of demand forecasting for multiple slow-moving inventory items,
Pareto optima for total weighted completion time and maximum lateness on a single machine,
A comment on scheduling on uniform machines under chain-type precedence constraints,
Retail replenishment models with display-space elastic demand,
Optimal stationary policies in a 3-stage serial production-distribution logistic chain facing constant and continuous demand,
Echelon base-stock policies are financially sub-optimal,
Two-machine open shop problem with controllable processing times,
Complexity of the job insertion problem in multi-stage scheduling,
Irreducible bin packing and normality in routing open shop,
An economic lot-size model with partial backlogging hinging on waiting time and shortage period,
Dynamic job assignment: a column generation approach with an application to surgery allocation,
Rapid improvement of stochastic networks using two-moment approximations,
A constraint generation approach for two-machine shop problems with jobs selection,
Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan,
Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches,
Online scheduling of incompatible unit-length job families with lookahead,
Optimal inventory management for a retail chain with diverse store demands,
Production planning with load dependent lead times: An update of research,
A best on-line algorithm for single machine scheduling with small delivery times,
Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks,
A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems,
Minimization of earliness, tardiness and due date penalties on uniform parallel machines with identical jobs,
Single machine scheduling with precedence constraints and positionally dependent processing times,
Coordination in a two-stage production system: complexity, conflict and cooperation,
A new heuristic for workload balancing on identical parallel machines and a statistical perspective on the workload balancing criteria,
Two branch-and-bound algorithms for the robust parallel machine scheduling problem,
Heuristic methods for the identical parallel machine flowtime problem with set-up times,
Parallel machine scheduling with nested job assignment restrictions,
Controlling distribution inventory systems with shipment consolidation and compound Poisson demand,
Knowledge-based framework for automated dynamic supply chain configuration,
Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration,
Improved rounding procedures for the discrete version of the capacitated EOQ problem,
Workforce planning in a lotsizing mail processing problem,
Terminal penalty rolling scheduling based on an initial schedule for single-machine scheduling problem,
Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior,
Levelling crane workload in multi-yard rail-road container terminals,
A scenario-based framework for supply planning under uncertainty: stochastic programming versus robust optimization approaches,
Integrated pricing and lot-sizing decisions in a serial supply chain,
Multi-plant production planning in capacitated self-configuring two-stage serial systems,
Deterministic job-shop scheduling: Past, present and future,
A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system,
Scheduling unitary task systems with zero--one communication delays for quasi-interval orders,
A fuzzy echelon approach for inventory management in supply chains.,
Optimal process control policies under a time-varying cost structure.,
A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing,
Three-machine open shop with a bottleneck machine revisited,
Mirror scheduling problems with early work and late work criteria,
Optimal utilization of ports' free-of-charge times in one distribution center and multiple ports inventory systems,
Online scheduling on a single machine with linear deteriorating processing times and delivery times,
Efficient lot-sizing under differential transportation cost structure for serially distributed warehouses,
Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs,
Scheduling preemptive jobs with precedence constraints on parallel machines,
Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound,
The effect of product variety on supply-chain performance,
Optimal and near-optimal inventory control policies for a make-to-order inventory-production system,
Scheduling multiple variant programs under hard real-time constraints,
Flow shop and open shop scheduling with a critical machine and two operations per job,
Single parameter analysis of power of preemption on two and three uniform machines,
Two-stage open shop scheduling with a bottleneck machine,
Optimal pricing and inventory policies: Centralized and decentralized decision making,
A survey of the state-of-the-art of common due date assignment and scheduling research,
Extending Graham's result on scheduling to other heuristics,
Online scheduling of two-machine flowshop with lookahead and incompatible job families,
A linear time approximation scheme for makespan minimization in an open shop with release dates,
A reusable iterative optimization software library to solve combinatorial problems with approximate reasoning,
Scheduling groups of unit length jobs on two identical parallel machines.,
Efficient scheduling of consumer goods manufacturing processes in the continuous time domain.,
Scheduling parallel dedicated machines under a single non-shared resource,
On scheduling an unbounded batch machine,
On-line scheduling of unit time jobs with rejection: Minimizing the total completion time,
Randomized algorithms for on-line scheduling problems: How low can't you go?