A GENERALIZED VERSION OF ONE MACHINE MAXIMUM LATENESS PROBLEM
スポンサーリンク
概要
- 論文の詳細を見る
In usual scheduling problem, machine speed is considered to be constant. Here we assume that the machine speed is controllable for each job and consider the maximum lateness problem on the single machine. The objective is to determine an optimal schedule and optimal jobwise speed of the machine minimizing the total sum of costs associated with the maximum lateness and jobwise machine speed.
- 社団法人日本オペレーションズ・リサーチ学会の論文
著者
-
Ishii Hiroaki
Osaka University
-
Tada M
Ryukoku Univ. Kyoto‐shi Jpn
-
Tada Minoru
Faculty of Business Administration, Ryukoku University
-
Nishida Toshio
Osaka University
-
Ishii H
Osaka University
-
Tada Minoru
Faculty Of Business Administration Ryukoku University
関連論文
- WATERMARKING FOR 3D POLYGONS USING WAVELET TRANSFORM AND MODIFIED TRAVELING SALESMAN PROBLEM
- MULTI-ITEM PRODUCTION PLANNING AND MANAGEMENT SYSTEM BASED ON UNFULFILLED ORDER RATE IN SUPPLY CHAIN
- Solution Method of Multi-Objective Decision Problem for Eco-Conscious Management by Particle Swarm Optimization(Theory of Modeling and Optimization)
- 8B1 PRODUCTION PLANNING SYSTEM FOR IMPLEMENTING MASS CUSTOMIZATION BY USING PARTICLE SWARM OPTIMIZATION(Technical session 8B: Customer orientation)
- 7B2 PROPOSAL OF COLLABORATION IN SUPPLY CHAIN FOR IMPLEMENTING MASS CUSTOMIZATION(Technical session 7B: Supply chain)
- Knowledge Discovery from Questionnaire Survey by Nonlinear Optimization(Mathematics of Optimization : Methods and Practical Solutions)
- Proposal of Heuristic Algorithm for Scheduling of Print Process in Auto Parts Supplier(Advanced Production Scheduling)
- A GENERALIZED VERSION OF ONE MACHINE MAXIMUM LATENESS PROBLEM
- STOCHASTIC BOUNDS FOR GENERALIZED SYSTEMS IN RELIABILITY THEORY
- ON AN EXTENSION OF BARLOW-WU SYSTEMS : BASIC PROPERTIES
- AMBULANCE SERVICE FACILITY LOCATION PROBLEM
- TWO-MACHINES SCHEDULING PROBLEM WITH FUZZY ALLOWABLE TIME CONSTRAINT
- AN EFFICIENT HEURISTIC FOR TRAFFIC GROOMING AND LIGHT-PATH ROUTING IN WDM RING NETWORKS WITH HOP-COUNT CONSTRAINT
- AN EFFICIENT COMPLETE ENUMERATION METHOD FOR NETWORK DESIGN PROBLEMS AND ITS APPLICATIONS
- CHANCE CONSTRAINED BOTTLENECK SPANNING TREE PROBLEM WITH FUZZY RANDOM EDGE COSTS
- Economic Structure of Cambodia and Strategies for Pro-Poor Growth: Results from a Computable General Equilibrium Analysis
- MINIMAX LOCATION PROBLEM WITH A-DISTANCE