Current trends in deterministic scheduling

From MaRDI portal
Publication:1374418

DOI10.1023/A:1018909801944zbMath0890.90102OpenAlexW2105413595MaRDI QIDQ1374418

Chung-Yee Lee, Lei Lei, Michael L. Pinedo

Publication date: 4 December 1997

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018909801944




Related Items

Minimising total flow-time on two parallel machines with planned downtimes and resumable jobsBicriteria robotic cell schedulingMakespan minimization for two parallel machines with an availability constraintMean flow time minimization with given bounds of processing timesParallel-machine scheduling with potential disruption and positional-dependent processing timesMachine Scheduling with a Maintenance Interval and Job Delivery CoordinationINTERVAL-VALUED REPRESENTABILITY OF QUALITATIVE DATA: THE CONTINUOUS CASEUnnamed ItemTotal completion time minimization on multiple machines subject to machine availability and makespan constraintsHeuristics for two-machine flowshop scheduling with setup times and an availability constraintMass customization in videotape duplication and conversion: challenges of flexible duplication systems, fast delivery, and electronic serviceParallel machine scheduling with machine availability and eligibility constraintsIntegrated production scheduling and maintenance policy for robustness in a single machineHybrid discrete differential evolution algorithm for biobjective cyclic hoist scheduling with reentranceA simple linear time approximation algorithm for multi-processor job scheduling on four processorsScheduling machine-dependent jobs to minimize lateness on machines with identical speed under availability constraintsAn approximation scheme for two-machine flowshop scheduling with setup times and an availability constraintA genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasksMinimizing total completion time on a single machine with a flexible maintenance activityGenerating artificial chromosomes with probability control in genetic algorithm for machine scheduling problemsPredicting the optimal period for Cyclic Hoist Scheduling ProblemsHeuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop.Route-enabling graph orientation problemsTwo-agent single machine scheduling with forbidden intervalsScheduling on same-speed processors with at most one downtime on each machineHybrid flow-shop scheduling problems with multiprocessor task systems.Scheduling with due date assignment under special conditions on job processingA particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasksScheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest firesGenetic algorithm and its performance analysis for scheduling a single craneScheduling with limited machine availabilityONLINE AND SEMI-ONLINE SCHEDULING ON CAPACITATED TWO-PARALLEL MACHINESAn efficient algorithm for multi-hoist cyclic scheduling with fixed processing timesScheduling on uniform processors with at most one downtime on each machineMachine scheduling with a maintenance interval and job delivery coordinationMaximizing business value by optimal assignment of jobs to resources in grid computingCost-based decision-making in middleware virtualization environmentsNon-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithmsScheduling and constraint propagationSingle-track multi-hoist scheduling problem: a collision-free resolution based on a branch-and-bound approachPreemptive scheduling with availability constraints to minimize total weighted completion timesScheduling two-stage hybrid flow shop with availability constraintsScheduling jobs with service level requirements on parallel machines under availability and eligibility constraintsA Lagrangian heuristic for satellite range scheduling with resource constraintsOptimal algorithms for online scheduling on parallel machines to minimize the makespan with a periodic availability constraintSingle machine scheduling with preventive maintenancesMathematical models for job-shop scheduling problems with routing and process plan flexibilitySingle-machine scheduling with maintenance and repair rate-modifying activitiesLot streaming in a multiple product permutation flow shop with interminglingTwo-machine flow shop scheduling integrated with preventive maintenance planningScheduling linear deteriorating jobs with an availability constraint on a single machineMinimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability intervalOptimization of processing and delivery decisions involving third-party machinesMultiple crane scheduling in a batch annealing process with no-delay constraints for machine unloadingTwo simulated annealing-based heuristics for the job shop scheduling problemIsomorphic scheduling problemsMakespan minimization for parallel machines scheduling with multiple availability constraintsThe coordination of single-machine scheduling with availability constraints and deliveryScheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristicsExponential inapproximability and FPTAS for scheduling with availability constraintsUniform machine scheduling with machine available constraintsOptimality of Jackson's permutations with respect to limited machine availabilityIdentical parallel-machine scheduling under availability constraints to minimize the sum of completion timesTwo-machine flowshop scheduling with availability constraintsMachine scheduling with a rate-modifying activityOptimal online algorithm for scheduling on two identical machines with machine availability constraints.Heuristics for two-machine no-wait flowshop scheduling with an availability constraintA multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysisMulti-level lot sizing and job shop scheduling with compressible process times: a cutting plane approach