[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

Tang et al., 2006 - Google Patents

A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time

Tang et al., 2006

Document ID
9964507415683667523
Author
Tang L
Xuan H
Liu J
Publication year
Publication venue
Computers & Operations Research

External Links

Snippet

We investigate the problem of scheduling n jobs in s-stage hybrid flowshops with parallel identical machines at each stage. The objective is to find a schedule that minimizes the sum of weighted completion times of the jobs. This problem has been proven to be NP-hard. In …
Continue reading at www.sciencedirect.com (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
    • G06Q10/063—Operations research or analysis
    • G06Q10/0631—Resource planning, allocation or scheduling for a business operation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management, e.g. organising, planning, scheduling or allocating time, human or machine resources; Enterprise planning; Organisational models
    • G06Q10/063—Operations research or analysis
    • G06Q10/0633—Workflow analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/04—Forecasting or optimisation, e.g. linear programming, "travelling salesman problem" or "cutting stock problem"
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/10—Office automation, e.g. computer aided management of electronic mail or groupware; Time management, e.g. calendars, reminders, meetings or time accounting
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06Q—DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTING PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/08—Logistics, e.g. warehousing, loading, distribution or shipping; Inventory or stock management, e.g. order filling, procurement or balancing against orders

Similar Documents

Publication Publication Date Title
Tang et al. A new Lagrangian relaxation algorithm for hybrid flowshop scheduling to minimize total weighted completion time
Xuan et al. Scheduling a hybrid flowshop with batch production at the last stage
Tang et al. An improved differential evolution algorithm for practical dynamic scheduling in steelmaking-continuous casting production
Ruiz et al. An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
Kuhpfahl et al. A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective
Méndez et al. State-of-the-art review of optimization methods for short-term scheduling of batch processes
Rahmani et al. Robust and stable flow shop scheduling with unexpected arrivals of new jobs and uncertain processing times
Sobaszek et al. Predictive scheduling as a part of intelligent job scheduling system
Liu et al. A hybrid shifting bottleneck procedure algorithm for the parallel-machine job-shop scheduling problem
KR100991316B1 (en) Use simulation to generate forecasts related to manufacturing facilities
Eren et al. A bicriteria scheduling with sequence-dependent setup times
Gomez Urrutia et al. Solving the integrated lot-sizing and job-shop scheduling problem
Yan et al. Novel formulation and resolution of job-shop scheduling problems
He et al. Bounded serial-batching scheduling for minimizing maximum lateness and makespan
Gaglioppa et al. Multitask and multistage production planning and scheduling for process industries
Zhao et al. A dynamic differential evolution algorithm for the dynamic single-machine scheduling problem with sequence-dependent setup times
Verbiest et al. Design of a chemical batch plant with parallel production lines: Plant configuration and cost effectiveness
Zhang et al. A divide-and-conquer strategy with particle swarm optimization for the job shop scheduling problem
Jiang et al. Colored Petri Nets with changeable structures (CPN-CS) and their applications in modeling one-of-a-kind production (OKP) systems
Roux et al. Multicriteria approach to rank scheduling strategies
Tang et al. Hybrid backward and forward dynamic programming based Lagrangian relaxation for single machine scheduling
Braune et al. Applying genetic algorithms to the optimization of production planning in a real-world manufacturing environment
Sun et al. Research on steelmaking-continuous casting production scheduling problem with uncertain processing time based on Lagrangian relaxation framework
Szczesny et al. Adjusted recombination operator for simulation-based construction schedule optimization
Zhao et al. Emergency local searching approach for job shop scheduling