Skip to main navigation
Skip to search
Skip to main content
New Jersey Institute of Technology Home
Help & FAQ
Home
Profiles
Research units
Facilities
Federal Grants
Research output
Press/Media
Search by expertise, name or affiliation
Container scheduling: Complexity and algorithms
Byung Cheon Choi
, Kangbok Lee
, Joseph Y.T. Leung
, Michael L. Pinedo
, Dirk Briskorn
Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
18
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Container scheduling: Complexity and algorithms'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Capacity Constraints
50%
Computational Complexity
50%
Container Scheduling
100%
Delivery Time
50%
Destination Port
100%
Due Date
50%
Equivalent Size
50%
Equivalent Unit
50%
Maximum Tardiness
50%
Release Dates
100%
Scheduling Algorithm
100%
Scheduling Complexity
100%
Scheduling Problem
50%
Simple Heuristics
50%
Worst-case Analysis
50%
Mathematics
Case Analysis
100%
Total Number
100%
Worst Case
100%
Engineering
Capacity Constraint
100%
Computational Complexity
100%
Worst Case Analysis
100%
Computer Science
Capacity Constraint
50%
Computational Complexity
50%
Destination Port
100%
Scheduling Problem
50%