scientific article

From MaRDI portal
Revision as of 12:59, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3995531

zbMath0798.90028MaRDI QIDQ3995531

No author found.

Publication date: 17 September 1992


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



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

Task scheduling in networksAn algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution timesScheduling jobs that arrive over timeA preliminary study on modeling stability of planning inventory and incentive effectsEchelon-stock \((R,nT)\) control in two-stage serial stochastic inventory systemsRobust single machine makespan scheduling with release date uncertaintyUnnamed ItemAn approximation algorithm for stacking up bins from a conveyer onto palletsScheduling unit jobs with compatible release dates on parallel machines with nonstationary speedsOnline Batch Scheduling of Incompatible Job Families with Variable Lookahead IntervalThe role of put option contracts in supply chain management under inflationBi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical testsMin Sum Edge Coloring in Multigraphs Via Configuration LPInventory control with modulated demand and a partially observed modulation processApproximation algorithms for batch scheduling with processing set restrictionsApproximation algorithms for two-machine proportionate routing open shop on a treeAnalysis of second order properties of production-inventory systems with lost salesSPT optimality (mostly) via linear programmingA Lower Bound for the On-Line Preemptive Machine Scheduling with ℓ p NormCan accessing much data reshape the theory? Inventory theory under the challenge of data-driven systemsOn the complexity of scheduling problems with a fixed number of parallel identical machinesOn Integral Policies in Deterministic and Stochastic Distribution SystemsAxiomatic rationality and ecological rationalityModeling industrial lot sizing problems: a reviewCombinação de abordagens GLSP e ATSP para o problema de dimensionamento e sequenciamento de lotes de produção de suplementos para nutrição animalScheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower boundsOptimal on-line algorithms for single-machine schedulingComplexity of Scheduling Few Types of Jobs on Related and Unrelated MachinesA note on scheduling flowshops with flexible stage orderingMinimizing maximum earliness on parallel identical machinesHow good is a dense shop schedule?A two-echelon inventory system with transportation capacity constraintQueueing systems with leadtime constraints: a fluid-model approach for admission and sequencing controlAggregate production planning for a continuous reconfigurable manufacturing processOptimal preemptive scheduling on a fixed number of identical parallel machinesMinmax earliness-tardiness costs with unit processing time jobsScheduling advertisements on a web page to maximize revenueA \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing timesTwo-machine open shop scheduling with an availability constraintSensitivity analysis of scheduling algorithmsA 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates.Linear time approximation scheme for the multiprocessor open shop problemSolving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industryThe impact of product substitution on retail merchandisingAn optimal online algorithm for scheduling two machines with release timesA scenario-based stochastic programming approach for technology and capacity planningb9000A 1/4 approximate algorithm for P2/tree/CmaxSUPPLY CHAIN MODELED AS A METABOLIC PATHWAYA new integer programming formulation of the graphical traveling salesman problemThe Periodic Joint Replenishment Problem Is Strongly 𝒩𝒫-HardPRODUCTIVITY OR UNEXPECTED DEMAND SHOCKS: WHAT DETERMINES FIRMS' INVESTMENT AND EXIT DECISIONS?Event-Time Models for Supply Chain SchedulingExact and approximate algorithms for the multi-period procurement problem where dedicated supplier capacity can be reservedSingle item lot sizing problemsPerformance guarantees for flowshop heuristics to minimize makespanPermutation flowshop scheduling problems with maximal and minimal time lagsA newsvendor inventory model with an emergency order to supply a non-increasing fraction of shortageSensitivity analysis of list scheduling heuristicsSingle machine scheduling with release and due date assignment to minimize the weighted number of late jobsA facility location model for logistics systems including reverse flows: the case of remanufacturing activitiesPerformance evaluation of a multi-echelon production, transportation and distribution system: a matrix analytical approachComputing redundant resources for the resource constrained project scheduling problemDifferent behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problemsSolving general multi-class closed queuing networks using parametric decompositionMeta-heuristics for dynamic lot sizing: a review and comparison of solution approachesAn integrated production and inventory model to dampen upstream demand variability in the supply chainA mixed integer programming approach for the single machine problem with unequal release datesA Bayesian analysis of a queueing system with unlimited serviceStability of a schedule minimizing mean flow timeImpact of product mix flexibility and allocation policies on technologyAn efficiency measurement framework for multi-stage production systemsAn open shop scheduling problem with a non-bottleneck machineTwo-stage no-wait scheduling models with setup and removal times separatedOn the existence of schedules that are near-optimal for both makespan and total weighted completion timeAn exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problemHeuristic stability: a permutation disarray measureA reactive GRASP and path relinking for a combined production-distribution problemProcessing networks with planned inventories: Tandem queues with feedbackOptimization of order-up-to-S policies for two-level inventory systems with compound Poisson demandSome thoughts on combinatorial optimisationGeneralized pairwise interchanges and machine schedulingDecomposition and iterative aggregation in hierarchical and decentralised planning structuresIs a unit-job shop not easier than identical parallel machines?Partial solutions and multifit algorithm for multiprocessor schedulingThe lazy bureaucrat scheduling problemIdentical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexityAn alternative framework to Lagrangian relaxation approach for job shop scheduling.Online algorithms for scheduling unit length jobs on parallel-batch machines with lookaheadProperties of optimal schedules in preemptive shop schedulingRouting open shop and flow shop scheduling problemsThe incremental bullwhip effect of operational deviations in an arborescent supply chain with requirements planningAn improved on-line algorithm for single parallel-batch machine scheduling with delivery timesOn the approximability of average completion time scheduling under precedence constraints.Real-time scheduling to minimize machine busy timesA concise survey of scheduling with time-dependent processing timesSingle 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 jobsScheduling problems for parallel dedicated machines under multiple resource constraints.Customer lead time management when both demand and price are lead time sensitive.






This page was built for publication: