Open Access System for Information Sharing

Login Library

Browse by Researchers

()

Department

Major(s): -

Co-researchers

Keyword

Publication & Time Cited Count (For the Last 5 years)

Results 1-9 of 9 (Search time: 0.003 seconds).

Applied search limites :

Subject : Approximation algorithm

Article

Bicriteria two-machine flowshop scheduling: approximation algorithms and their limitsSCIE

Journal of Scheduling, vol. 27, no. 1, page. 61 - 86, 2024-02

Article

Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion timeSCIE

European Journal of Operational Research, vol. 305, no. 2, page. 594 - 607, 2023-03

Article

An improved algorithm for a two-stage production scheduling problem with an outsourcing optionSCIESCOPUS

THEORETICAL COMPUTER SCIENCE, vol. 876, page. 59 - 69, 2021-07

Article

Improved Algorithms for Single Machine Scheduling with Release dates and RejectionsSCIESCOPUS

4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, vol. 14, no. 1, page. 41 - 55, 2016-03

Article

Two-Stage Proportionate Flexible Flow Shop to Minimize the MakespanSCIESCOPUS

JOURNAL OF COMBINATORIAL OPTIMIZATION, vol. 25, no. 1, page. 123 - 134, 2013-01

Article

Two-Stage Production Scheduling with an Outsourcing OptionSCIESCOPUS

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, vol. 213, no. 3, page. 489 - 497, 2011-09-16

Article

Flow Shops with Machine Maintenance: Ordered and Proportionate CasesSCIESCOPUS

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, vol. 207, no. 1, page. 97 - 104, 2010-11

Article

A Note on Graph Balancing Problems with RestrictionsSCIESCOPUS

INFORMATION PROCESSING LETTERS, vol. 110, no. 1, page. 24 - 29, 2009-12-01

Article

Approximation Algorithms for Multi-agent Scheduling to Minimize Total Weighted Completion TimeSCIESCOPUS

INFORMATION PROCESSING LETTERS, vol. 109, no. 16, page. 913 - 917, 2009-07-31

1

OAK

개인정보처리방침 Personal Information Protection Policy

library@postech.ac.kr Tel: 054-279-2548

Copyrights © by 2017 Pohang University of Science ad Technology All right reserved.

Browse

Login Library Help